Chroma coding enhancement in cross-component sample adaptive offset with virtual boundary

ABSTRACT

An electronic apparatus performs a method of decoding video data. The method comprises: receiving, from the video signal, a picture frame that includes a first component and a second component; determining a classifier for the second component from a set of samples of the first component associated with a respective sample of the second component; when the set of samples of the first component associated with the respective sample of the second component is divided by a virtual boundary, copying one or more central subsets of the set of samples of the first component to a first boundary position and a second boundary position of the set of samples of the first component; determining a sample offset for the respective sample of the second component according to the classifier; and modifying the value of the respective sample of the second component based on the determined sample offset.

RELATED APPLICATIONS

This application is a continuation application of PCT Patent ApplicationNo. PCT/US2021/056897, entitled “CHROMA CODING ENHANCEMENT INCROSS-COMPONENT SAMPLE ADAPTIVE OFFSET WITH VIRTUAL BOUNDARY” filed onOct. 27, 2021, which claims priority to U.S. Provisional PatentApplication No. 63/106,357, entitled “Cross-component Sample AdaptiveOffset” filed Oct. 28, 2020. The disclosures of both the priorapplications are incorporated by reference in their entirety.

TECHNICAL FIELD

The present application generally relates to video coding andcompression, and more specifically, to methods and apparatus onimproving the chroma coding efficiency.

BACKGROUND

Digital video is supported by a variety of electronic devices, such asdigital televisions, laptop or desktop computers, tablet computers,digital cameras, digital recording devices, digital media players, videogaming consoles, smart phones, video teleconferencing devices, videostreaming devices, etc. The electronic devices transmit, receive,encode, decode, and/or store digital video data by implementing videocompression/decompression standards. Some well-known video codingstandards include Versatile Video Coding (VVC), High Efficiency VideoCoding (HEVC, also known as H.265 or MPEG-H Part 2) and Advanced VideoCoding (AVC, also known as H.264 or MPEG-4 Part 10), which are jointlydeveloped by ISO/IEC MPEG and ITU-T VCEG. AOMedia Video 1 (AV1) wasdeveloped by Alliance for Open Media (AOM) as a successor to itspreceding standard VP9. Audio Video Coding (AVS), which refers todigital audio and digital video compression standard, is another videocompression standard series developed by the Audio and Video CodingStandard Workgroup of China.

Video compression typically includes performing spatial (intra frame)prediction and/or temporal (inter frame) prediction to reduce or removeredundancy inherent in the video data. For block-based video coding, avideo frame is partitioned into one or more slices, each slice havingmultiple video blocks, which may also be referred to as coding treeunits (CTUs). Each CTU may contain one coding unit (CU) or recursivelysplit into smaller CUs until the predefined minimum CU size is reached.Each CU (also named leaf CU) contains one or multiple transform units(TUs) and each CU also contains one or multiple prediction units (PUs).Each CU can be coded in either intra, inter or IBC modes. Video blocksin an intra coded (I) slice of a video frame are encoded using spatialprediction with respect to reference samples in neighboring blockswithin the same video frame. Video blocks in an inter coded (P or B)slice of a video frame may use spatial prediction with respect toreference samples in neighboring blocks within the same video frame ortemporal prediction with respect to reference samples in other previousand/or future reference video frames.

Spatial or temporal prediction based on a reference block that has beenpreviously encoded, e.g., a neighboring block, results in a predictiveblock for a current video block to be coded. The process of finding thereference block may be accomplished by block matching algorithm.Residual data representing pixel differences between the current blockto be coded and the predictive block is referred to as a residual blockor prediction errors. An inter-coded block is encoded according to amotion vector that points to a reference block in a reference frameforming the predictive block, and the residual block. The process ofdetermining the motion vector is typically referred to as motionestimation. An intra coded block is encoded according to an intraprediction mode and the residual block. For further compression, theresidual block is transformed from the pixel domain to a transformdomain, e.g., frequency domain, resulting in residual transformcoefficients, which may then be quantized. The quantized transformcoefficients, initially arranged in a two-dimensional array, may bescanned to produce a one-dimensional vector of transform coefficients,and then entropy encoded into a video bitstream to achieve even morecompression.

The encoded video bitstream is then saved in a computer-readable storagemedium (e.g., flash memory) to be accessed by another electronic devicewith digital video capability or directly transmitted to the electronicdevice wired or wirelessly. The electronic device then performs videodecompression (which is an opposite process to the video compressiondescribed above) by, e.g., parsing the encoded video bitstream to obtainsyntax elements from the bitstream and reconstructing the digital videodata to its original format from the encoded video bitstream based atleast in part on the syntax elements obtained from the bitstream, andrenders the reconstructed digital video data on a display of theelectronic device.

With digital video quality going from high definition, to 4K×2K or even8K×4K, the amount of vide data to be encoded/decoded growsexponentially. It is a constant challenge in terms of how the video datacan be encoded/decoded more efficiently while maintaining the imagequality of the decoded video data.

SUMMARY

The present application describes implementations related to video dataencoding and decoding and, more particularly, to methods and apparatuson improving the coding efficiency of chroma coding, including improvingthe coding efficiency by exploring cross-component relationship betweenluma and chroma components.

According to a first aspect of the present application, a method ofdecoding video signal comprises: receiving, from the video signal, apicture frame that includes a first component and a second component;determining a classifier for the second component from a set of samplesof the first component associated with a respective sample of the secondcomponent; in response to a determination that the set of samples of thefirst component associated with the respective sample of the secondcomponent is divided by a virtual boundary, obtaining an updated set ofsamples of the first component by copying one or more central subsets ofthe set of samples of the first component to a first boundary positionand a second boundary position of the set of samples of the firstcomponent, wherein the one or more central subsets are at a same side ofthe virtual boundary relative to the respective sample of the secondcomponent; determining a sample offset for the respective sample of thesecond component according to the classifier based on the updated set ofsamples of the first component; and modifying the value of therespective sample of the second component based on the determined sampleoffset.

According to a second aspect of the present application, an electronicapparatus includes one or more processing units, memory and a pluralityof programs stored in the memory. The programs, when executed by the oneor more processing units, cause the electronic apparatus to perform themethod of coding video data as described above.

According to a third aspect of the present application, a non-transitorycomputer readable storage medium stores a plurality of programs forexecution by an electronic apparatus having one or more processingunits. The programs, when executed by the one or more processing units,cause the electronic apparatus to perform the method of coding videodata as described above.

BRIEF DESCRIPTION OF DRAWINGS

The accompanying drawings, which are included to provide a furtherunderstanding of the implementations and are incorporated herein andconstitute a part of the specification, illustrate the describedimplementations and together with the description serve to explain theunderlying principles. Like reference numerals refer to correspondingparts.

FIG. 1 is a block diagram illustrating an exemplary video encoding anddecoding system in accordance with some implementations of the presentdisclosure.

FIG. 2 is a block diagram illustrating an exemplary video encoder inaccordance with some implementations of the present disclosure.

FIG. 3 is a block diagram illustrating an exemplary video decoder inaccordance with some implementations of the present disclosure.

FIGS. 4A through 4E are block diagrams illustrating how a frame isrecursively partitioned into multiple video blocks of different sizesand shapes in accordance with some implementations of the presentdisclosure.

FIG. 5 is a block diagram depicting the four gradient patterns used inSample Adaptive Offset (SAO) in accordance with some implementations ofthe present disclosure.

FIG. 6A is a block diagram illustrating the system and process ofCross-Component Sample Adaptive Offset (CCSAO) according to someimplementations of the present disclosure.

FIG. 6B is a block diagram illustrating the system and process of CCSAOapplied in parallel with Enhanced Sample Adaptive Offset (ESAO) in theAVS standard according to some implementations of the presentdisclosure.

FIG. 6C is a block diagram illustrating the system and process of CCSAOapplied after SAO according to some implementations of the presentdisclosure.

FIG. 6D is a block diagram illustrating the system and process of CCSAOapplied in parallel with Cross-Component Adaptive Loop Filter (CCALF)according to some implementations of the present disclosure.

FIG. 7 is a block diagram illustrating a sample process using CCSAO inaccordance with some implementations of the present disclosure.

FIG. 8 is a block diagram illustrating that CCSAO process is interleavedto vertical and horizontal deblocking filter (DBF) in accordance withsome implementations of the present disclosure.

FIG. 9 is a flowchart illustrating an exemplary process of decodingvideo signal using cross-component correlation in accordance with someimplementations of the present disclosure.

FIG. 10A is a block diagram showing a classifier using different lumasample position for classification in accordance with someimplementations of the present disclosure.

FIG. 10B illustrates some examples of different shapes for lumacandidates, in accordance with some implementations of the presentdisclosure.

FIG. 11 is a block diagram of a sample process illustrating that besidesluma, the other cross-component collocated and neighboring chromasamples are also fed into CCSAO classification in accordance with someimplementations of the present disclosure.

FIG. 12 illustrates exemplary classifiers by replacing the collocatedluma sample value with a value obtained by weighing collocated andneighboring luma samples in accordance with some implementations of thepresent disclosure.

FIG. 13A is a block diagram illustrating CCSAO is not applied on thecurrent chroma sample if any of the collocated and neighboring lumasamples used for classification is outside the current picture inaccordance with some implementations of the present disclosure.

FIG. 13B is a block diagram illustrating CCSAO is applied on the currentchroma sample if any of the collocated and neighboring luma samples usedfor classification is outside the current picture in accordance withsome implementations of the present disclosure.

FIG. 14 is a block diagram illustrating CCSAO is not applied on thecurrent chroma sample if a corresponding selected collocated orneighboring luma sample used for classification is outside a virtualspace defined by a virtual boundary (VB) in accordance with someimplementations of the present disclosure.

FIG. 15 shows repetitive or mirror padding is applied on the lumasamples that are outside the virtual boundary in accordance with someimplementations of the present disclosure.

FIG. 16 shows additional 1 luma line buffer is required if all 9collocated neighboring luma samples are used for classification inaccordance with some implementations of the present disclosure.

FIG. 17 shows an illustration in AVS that 9 luma candidates CCSAOcrossing VB may increase 2 additional luma line buffers in accordancewith some implementations of the present disclosure.

FIG. 18 shows an illustration in VVC that 9 luma candidates CCSAOcrossing VB may increase 1 additional luma line buffer in accordancewith some implementations of the present disclosure.

FIGS. 19A-19C show in AVS and VVC, CCSAO is disabled for a chroma sampleif any of the chroma sample's luma candidates is across VB (outside thecurrent chroma sample VB) in accordance with some implementations of thepresent disclosure.

FIGS. 20A-20C show in AVS and VVC, CCSAO is enabled using repetitivepadding for a chroma sample if any of the chroma sample's lumacandidates is across VB (outside the current chroma sample VB) inaccordance with some implementations of the present disclosure.

FIGS. 21A-21C show in AVS and VVC, CCSAO is enabled using mirror paddingfor a chroma sample if any of the chroma sample's luma candidates isacross VB (outside the current chroma sample VB) in accordance with someimplementations of the present disclosure.

FIGS. 22A-22B show that CCSAO is enabled using double sided symmetricpadding for different CCSAO sample shapes in accordance with someimplementations of the present disclosure.

FIG. 23 shows the restrictions of using a limited number of lumacandidates for classification in accordance with some implementations ofthe present disclosure.

FIG. 24 shows the CCSAO applied region is not aligned to the coding treeblock (CTB)/coding tree unit (CTU) boundary in accordance with someimplementations of the present disclosure.

FIG. 25 shows that the CCSAO applied region frame partition can be fixedwith CCSAO parameters in accordance with some implementations of thepresent disclosure.

FIG. 26 shows that the CCSAO applied region can be Binary-tree(BT)/Quad-tree (QT)/Ternary-tree (TT) split from frame/slice/CTB levelin accordance with some implementations of the present disclosure.

FIG. 27 is a block diagram illustrating that the SAO classificationmethods disclosed in the present disclosure serve as a post predictionfilter in accordance with some implementations of the presentdisclosure.

FIG. 28 is a block diagram illustrating that for post prediction SAOfilter, each component can use the current and neighboring samples forclassification in accordance with some implementations of the presentdisclosure.

FIG. 29 is a flowchart illustrating an exemplary process of decodingvideo signal using cross-component correlation when Virtual Boundary ispresent in accordance with some implementations of the presentdisclosure.

DETAILED DESCRIPTION

Reference will now be made in detail to specific implementations,examples of which are illustrated in the accompanying drawings. In thefollowing detailed description, numerous non-limiting specific detailsare set forth in order to assist in understanding the subject matterpresented herein. But it will be apparent to one of ordinary skill inthe art that various alternatives may be used without departing from thescope of claims and the subject matter may be practiced without thesespecific details. For example, it will be apparent to one of ordinaryskill in the art that the subject matter presented herein can beimplemented on many types of electronic devices with digital videocapabilities.

The first generation AVS standard includes Chinese national standard“Information Technology, Advanced Audio Video Coding, Part 2: Video”(known as AVS1) and “Information Technology, Advanced Audio Video CodingPart 16: Radio Television Video” (known as AVS+). It can offer around50% bit-rate saving at the same perceptual quality compared to MPEG-2standard. The second generation AVS standard includes the series ofChinese national standard “Information Technology, Efficient MultimediaCoding” (knows as AVS2), which is mainly targeted at the transmission ofextra HD TV programs. The coding efficiency of the AVS2 is double ofthat of the AVS+. Meanwhile, the AVS2 standard video part was submittedby Institute of Electrical and Electronics Engineers (IEEE) as oneinternational standard for applications. The AVS3 standard is one newgeneration video coding standard for UHD video application aiming atsurpassing the coding efficiency of the latest international standardHEVC, which provides approximately 30% bit-rate savings over the HEVCstandard. In March 2019, at the 68-th AVS meeting, the AVS3-P2 baselinewas finished, which provides approximately 30% bit-rate savings over theHEVC standard. Currently, one reference software, called highperformance model (HPM), is maintained by the AVS group to demonstrate areference implementation of the AVS3 standard. Like the HEVC, the AVS3standard is built upon the block-based hybrid video coding framework.

FIG. 1 is a block diagram illustrating an exemplary system 10 forencoding and decoding video blocks in parallel in accordance with someimplementations of the present disclosure. As shown in FIG. 1 , system10 includes a source device 12 that generates and encodes video data tobe decoded at a later time by a destination device 14. Source device 12and destination device 14 may comprise any of a wide variety ofelectronic devices, including desktop or laptop computers, tabletcomputers, smart phones, set-top boxes, digital televisions, cameras,display devices, digital media players, video gaming consoles, videostreaming device, or the like. In some implementations, source device 12and destination device 14 are equipped with wireless communicationcapabilities.

In some implementations, destination device 14 may receive the encodedvideo data to be decoded via a link 16. Link 16 may comprise any type ofcommunication medium or device capable of moving the encoded video datafrom source device 12 to destination device 14. In one example, link 16may comprise a communication medium to enable source device 12 totransmit the encoded video data directly to destination device 14 inreal-time. The encoded video data may be modulated according to acommunication standard, such as a wireless communication protocol, andtransmitted to destination device 14. The communication medium maycomprise any wireless or wired communication medium, such as a radiofrequency (RF) spectrum or one or more physical transmission lines. Thecommunication medium may form part of a packet-based network, such as alocal area network, a wide-area network, or a global network such as theInternet. The communication medium may include routers, switches, basestations, or any other equipment that may be useful to facilitatecommunication from source device 12 to destination device 14.

In some other implementations, the encoded video data may be transmittedfrom output interface 22 to a storage device 32. Subsequently, theencoded video data in storage device 32 may be accessed by destinationdevice 14 via input interface 28. Storage device 32 may include any of avariety of distributed or locally accessed data storage media such as ahard drive, Blu-ray discs, DVDs, CD-ROMs, flash memory, volatile ornon-volatile memory, or any other suitable digital storage media forstoring encoded video data. In a further example, storage device 32 maycorrespond to a file server or another intermediate storage device thatmay hold the encoded video data generated by source device 12.Destination device 14 may access the stored video data from storagedevice 32 via streaming or downloading. The file server may be any typeof computer capable of storing encoded video data and transmitting theencoded video data to destination device 14. Exemplary file serversinclude a web server (e.g., for a website), an FTP server, networkattached storage (NAS) devices, or a local disk drive. Destinationdevice 14 may access the encoded video data through any standard dataconnection, including a wireless channel (e.g., a Wi-Fi connection), awired connection (e.g., DSL, cable modem, etc.), or a combination ofboth that is suitable for accessing encoded video data stored on a fileserver. The transmission of encoded video data from storage device 32may be a streaming transmission, a download transmission, or acombination of both.

As shown in FIG. 1 , source device 12 includes a video source 18, avideo encoder 20 and an output interface 22. Video source 18 may includea source such as a video capture device, e.g., a video camera, a videoarchive containing previously captured video, a video feed interface toreceive video from a video content provider, and/or a computer graphicssystem for generating computer graphics data as the source video, or acombination of such sources. As one example, if video source 18 is avideo camera of a security surveillance system, source device 12 anddestination device 14 may form camera phones or video phones. However,the implementations described in the present application may beapplicable to video coding in general, and may be applied to wirelessand/or wired applications.

The captured, pre-captured, or computer-generated video may be encodedby video encoder 20. The encoded video data may be transmitted directlyto destination device 14 via output interface 22 of source device 12.The encoded video data may also (or alternatively) be stored ontostorage device 32 for later access by destination device 14 or otherdevices, for decoding and/or playback. Output interface 22 may furtherinclude a modem and/or a transmitter.

Destination device 14 includes an input interface 28, a video decoder30, and a display device 34. Input interface 28 may include a receiverand/or a modem and receive the encoded video data over link 16. Theencoded video data communicated over link 16, or provided on storagedevice 32, may include a variety of syntax elements generated by videoencoder 20 for use by video decoder 30 in decoding the video data. Suchsyntax elements may be included within the encoded video datatransmitted on a communication medium, stored on a storage medium, orstored a file server.

In some implementations, destination device 14 may include a displaydevice 34, which can be an integrated display device and an externaldisplay device that is configured to communicate with destination device14. Display device 34 displays the decoded video data to a user, and maycomprise any of a variety of display devices such as a liquid crystaldisplay (LCD), a plasma display, an organic light emitting diode (OLED)display, or another type of display device.

Video encoder 20 and video decoder 30 may operate according toproprietary or industry standards, such as VVC, HEVC, MPEG-4, Part 10,Advanced Video Coding (AVC), AVS, or extensions of such standards. Itshould be understood that the present application is not limited to aspecific video coding/decoding standard and may be applicable to othervideo coding/decoding standards. It is generally contemplated that videoencoder 20 of source device 12 may be configured to encode video dataaccording to any of these current or future standards. Similarly, it isalso generally contemplated that video decoder 30 of destination device14 may be configured to decode video data according to any of thesecurrent or future standards.

Video encoder 20 and video decoder 30 each may be implemented as any ofa variety of suitable encoder circuitry, such as one or moremicroprocessors, digital signal processors (DSPs), application specificintegrated circuits (ASICs), field programmable gate arrays (FPGAs),discrete logic, software, hardware, firmware or any combinationsthereof. When implemented partially in software, an electronic devicemay store instructions for the software in a suitable, non-transitorycomputer-readable medium and execute the instructions in hardware usingone or more processors to perform the video coding/decoding operationsdisclosed in the present disclosure. Each of video encoder 20 and videodecoder 30 may be included in one or more encoders or decoders, eitherof which may be integrated as part of a combined encoder/decoder (CODEC)in a respective device.

FIG. 2 is a block diagram illustrating an exemplary video encoder 20 inaccordance with some implementations described in the presentapplication. Video encoder 20 may perform intra and inter predictivecoding of video blocks within video frames. Intra predictive codingrelies on spatial prediction to reduce or remove spatial redundancy invideo data within a given video frame or picture. Inter predictivecoding relies on temporal prediction to reduce or remove temporalredundancy in video data within adjacent video frames or pictures of avideo sequence.

As shown in FIG. 2 , video encoder 20 includes video data memory 40,prediction processing unit 41, decoded picture buffer (DPB) 64, summer50, transform processing unit 52, quantization unit 54, and entropyencoding unit 56. Prediction processing unit 41 further includes motionestimation unit 42, motion compensation unit 44, partition unit 45,intra prediction processing unit 46, and intra block copy (BC) unit 48.In some implementations, video encoder 20 also includes inversequantization unit 58, inverse transform processing unit 60, and summer62 for video block reconstruction. An in-loop filter 63, such as adeblocking filter may be positioned between summer 62 and DPB 64 tofilter block boundaries to remove blockiness artifacts fromreconstructed video. Another in-loop filter 63 may also be used inaddition to the deblocking filter to filter the output of summer 62.Further in-loop filtering 63, such as sample adaptive offset (SAO) andadaptive in-loop filter (ALF) may be applied on the reconstructed CUbefore it is put in the reference picture store and used as reference tocode future video blocks. Video encoder 20 may take the form of a fixedor programmable hardware unit or may be divided among one or more of theillustrated fixed or programmable hardware units.

Video data memory 40 may store video data to be encoded by thecomponents of video encoder 20. The video data in video data memory 40may be obtained, for example, from video source 18. DPB 64 is a bufferthat stores reference video data for use in encoding video data by videoencoder 20 (e.g., in intra or inter predictive coding modes). Video datamemory 40 and DPB 64 may be formed by any of a variety of memorydevices. In various examples, video data memory 40 may be on-chip withother components of video encoder 20, or off-chip relative to thosecomponents.

As shown in FIG. 2 , after receiving video data, partition unit 45within prediction processing unit 41 partitions the video data intovideo blocks. This partitioning may also include partitioning a videoframe into slices, tiles, or other larger coding units (CUs) accordingto a predefined splitting structures such as quad-tree structureassociated with the video data. The video frame may be divided intomultiple video blocks (or sets of video blocks referred to as tiles).Prediction processing unit 41 may select one of a plurality of possiblepredictive coding modes, such as one of a plurality of intra predictivecoding modes or one of a plurality of inter predictive coding modes, forthe current video block based on error results (e.g., coding rate andthe level of distortion). Prediction processing unit 41 may provide theresulting intra or inter prediction coded block to summer 50 to generatea residual block and to summer 62 to reconstruct the encoded block foruse as part of a reference frame subsequently. Prediction processingunit 41 also provides syntax elements, such as motion vectors,intra-mode indicators, partition information, and other such syntaxinformation, to entropy encoding unit 56.

In order to select an appropriate intra predictive coding mode for thecurrent video block, intra prediction processing unit 46 withinprediction processing unit 41 may perform intra predictive coding of thecurrent video block relative to one or more neighboring blocks in thesame frame as the current block to be coded to provide spatialprediction. Motion estimation unit 42 and motion compensation unit 44within prediction processing unit 41 perform inter predictive coding ofthe current video block relative to one or more predictive blocks in oneor more reference frames to provide temporal prediction. Video encoder20 may perform multiple coding passes, e.g., to select an appropriatecoding mode for each block of video data.

In some implementations, motion estimation unit 42 determines the interprediction mode for a current video frame by generating a motion vector,which indicates the displacement of a prediction unit (PU) of a videoblock within the current video frame relative to a predictive blockwithin a reference video frame, according to a predetermined patternwithin a sequence of video frames. Motion estimation, performed bymotion estimation unit 42, is the process of generating motion vectors,which estimate motion for video blocks. A motion vector, for example,may indicate the displacement of a PU of a video block within a currentvideo frame or picture relative to a predictive block within a referenceframe (or other coded unit) relative to the current block being codedwithin the current frame (or other coded unit). The predeterminedpattern may designate video frames in the sequence as P frames or Bframes. Intra BC unit 48 may determine vectors, e.g., block vectors, forintra BC coding in a manner similar to the determination of motionvectors by motion estimation unit 42 for inter prediction, or mayutilize motion estimation unit 42 to determine the block vector.

A predictive block is a block of a reference frame that is deemed asclosely matching the PU of the video block to be coded in terms of pixeldifference, which may be determined by sum of absolute difference (SAD),sum of square difference (SSD), or other difference metrics. In someimplementations, video encoder 20 may calculate values for sub-integerpixel positions of reference frames stored in DPB 64. For example, videoencoder 20 may interpolate values of one-quarter pixel positions,one-eighth pixel positions, or other fractional pixel positions of thereference frame. Therefore, motion estimation unit 42 may perform amotion search relative to the full pixel positions and fractional pixelpositions and output a motion vector with fractional pixel precision.

Motion estimation unit 42 calculates a motion vector for a PU of a videoblock in an inter prediction coded frame by comparing the position ofthe PU to the position of a predictive block of a reference frameselected from a first reference frame list (List 0) or a secondreference frame list (List 1), each of which identifies one or morereference frames stored in DPB 64. Motion estimation unit 42 sends thecalculated motion vector to motion compensation unit 44 and then toentropy encoding unit 56.

Motion compensation, performed by motion compensation unit 44, mayinvolve fetching or generating the predictive block based on the motionvector determined by motion estimation unit 42. Upon receiving themotion vector for the PU of the current video block, motion compensationunit 44 may locate a predictive block to which the motion vector pointsin one of the reference frame lists, retrieve the predictive block fromDPB 64, and forward the predictive block to summer 50. Summer 50 thenforms a residual video block of pixel difference values by subtractingpixel values of the predictive block provided by motion compensationunit 44 from the pixel values of the current video block being coded.The pixel difference values forming the residual vide block may includeluma or chroma difference components or both. Motion compensation unit44 may also generate syntax elements associated with the video blocks ofa video frame for use by video decoder 30 in decoding the video blocksof the video frame. The syntax elements may include, for example, syntaxelements defining the motion vector used to identify the predictiveblock, any flags indicating the prediction mode, or any other syntaxinformation described herein. Note that motion estimation unit 42 andmotion compensation unit 44 may be highly integrated, but areillustrated separately for conceptual purposes.

In some implementations, intra BC unit 48 may generate vectors and fetchpredictive blocks in a manner similar to that described above inconnection with motion estimation unit 42 and motion compensation unit44, but with the predictive blocks being in the same frame as thecurrent block being coded and with the vectors being referred to asblock vectors as opposed to motion vectors. In particular, intra BC unit48 may determine an intra-prediction mode to use to encode a currentblock. In some examples, intra BC unit 48 may encode a current blockusing various intra-prediction modes, e.g., during separate encodingpasses, and test their performance through rate-distortion analysis.Next, intra BC unit 48 may select, among the various testedintra-prediction modes, an appropriate intra-prediction mode to use andgenerate an intra-mode indicator accordingly. For example, intra BC unit48 may calculate rate-distortion values using a rate-distortion analysisfor the various tested intra-prediction modes, and select theintra-prediction mode having the best rate-distortion characteristicsamong the tested modes as the appropriate intra-prediction mode to use.Rate-distortion analysis generally determines an amount of distortion(or error) between an encoded block and an original, unencoded blockthat was encoded to produce the encoded block, as well as a bitrate(i.e., a number of bits) used to produce the encoded block. Intra BCunit 48 may calculate ratios from the distortions and rates for thevarious encoded blocks to determine which intra-prediction mode exhibitsthe best rate-distortion value for the block.

In other examples, intra BC unit 48 may use motion estimation unit 42and motion compensation unit 44, in whole or in part, to perform suchfunctions for Intra BC prediction according to the implementationsdescribed herein. In either case, for Intra block copy, a predictiveblock may be a block that is deemed as closely matching the block to becoded, in terms of pixel difference, which may be determined by sum ofabsolute difference (SAD), sum of squared difference (SSD), or otherdifference metrics, and identification of the predictive block mayinclude calculation of values for sub-integer pixel positions.

Whether the predictive block is from the same frame according to intraprediction, or a different frame according to inter prediction, videoencoder 20 may form a residual video block by subtracting pixel valuesof the predictive block from the pixel values of the current video blockbeing coded, forming pixel difference values. The pixel differencevalues forming the residual video block may include both luma and chromacomponent differences.

Intra prediction processing unit 46 may intra-predict a current videoblock, as an alternative to the inter-prediction performed by motionestimation unit 42 and motion compensation unit 44, or the intra blockcopy prediction performed by intra BC unit 48, as described above. Inparticular, intra prediction processing unit 46 may determine an intraprediction mode to use to encode a current block. To do so, intraprediction processing unit 46 may encode a current block using variousintra prediction modes, e.g., during separate encoding passes, and intraprediction processing unit 46 (or a mode select unit, in some examples)may select an appropriate intra prediction mode to use from the testedintra prediction modes. Intra prediction processing unit 46 may provideinformation indicative of the selected intra-prediction mode for theblock to entropy encoding unit 56. Entropy encoding unit 56 may encodethe information indicating the selected intra-prediction mode in thebitstream.

After prediction processing unit 41 determines the predictive block forthe current video block via either inter prediction or intra prediction,summer 50 forms a residual video block by subtracting the predictiveblock from the current video block. The residual video data in theresidual block may be included in one or more transform units (TUs) andis provided to transform processing unit 52. Transform processing unit52 transforms the residual video data into residual transformcoefficients using a transform, such as a discrete cosine transform(DCT) or a conceptually similar transform.

Transform processing unit 52 may send the resulting transformcoefficients to quantization unit 54. Quantization unit 54 quantizes thetransform coefficients to further reduce bit rate. The quantizationprocess may also reduce the bit depth associated with some or all of thecoefficients. The degree of quantization may be modified by adjusting aquantization parameter. In some examples, quantization unit 54 may thenperform a scan of a matrix including the quantized transformcoefficients. Alternatively, entropy encoding unit 56 may perform thescan.

Following quantization, entropy encoding unit 56 entropy encodes thequantized transform coefficients into a video bitstream using, e.g.,context adaptive variable length coding (CAVLC), context adaptive binaryarithmetic coding (CABAC), syntax-based context-adaptive binaryarithmetic coding (SBAC), probability interval partitioning entropy(PIPE) coding or another entropy encoding methodology or technique. Theencoded bitstream may then be transmitted to video decoder 30, orarchived in storage device 32 for later transmission to or retrieval byvideo decoder 30. Entropy encoding unit 56 may also entropy encode themotion vectors and the other syntax elements for the current video framebeing coded.

Inverse quantization unit 58 and inverse transform processing unit 60apply inverse quantization and inverse transformation, respectively, toreconstruct the residual video block in the pixel domain for generatinga reference block for prediction of other video blocks. As noted above,motion compensation unit 44 may generate a motion compensated predictiveblock from one or more reference blocks of the frames stored in DPB 64.Motion compensation unit 44 may also apply one or more interpolationfilters to the predictive block to calculate sub-integer pixel valuesfor use in motion estimation.

Summer 62 adds the reconstructed residual block to the motioncompensated predictive block produced by motion compensation unit 44 toproduce a reference block for storage in DPB 64. The reference block maythen be used by intra BC unit 48, motion estimation unit 42 and motioncompensation unit 44 as a predictive block to inter predict anothervideo block in a subsequent video frame.

FIG. 3 is a block diagram illustrating an exemplary video decoder 30 inaccordance with some implementations of the present application. Videodecoder 30 includes video data memory 79, entropy decoding unit 80,prediction processing unit 81, inverse quantization unit 86, inversetransform processing unit 88, summer 90, and DPB 92. Predictionprocessing unit 81 further includes motion compensation unit 82, intraprediction processing unit 84, and intra BC unit 85. Video decoder 30may perform a decoding process generally reciprocal to the encodingprocess described above with respect to video encoder 20 in connectionwith FIG. 2 . For example, motion compensation unit 82 may generateprediction data based on motion vectors received from entropy decodingunit 80, while intra-prediction unit 84 may generate prediction databased on intra-prediction mode indicators received from entropy decodingunit 80.

In some examples, a unit of video decoder 30 may be tasked to performthe implementations of the present application. Also, in some examples,the implementations of the present disclosure may be divided among oneor more of the units of video decoder 30. For example, intra BC unit 85may perform the implementations of the present application, alone, or incombination with other units of video decoder 30, such as motioncompensation unit 82, intra prediction processing unit 84, and entropydecoding unit 80. In some examples, video decoder 30 may not includeintra BC unit 85 and the functionality of intra BC unit 85 may beperformed by other components of prediction processing unit 81, such asmotion compensation unit 82.

Video data memory 79 may store video data, such as an encoded videobitstream, to be decoded by the other components of video decoder 30.The video data stored in video data memory 79 may be obtained, forexample, from storage device 32, from a local video source, such as acamera, via wired or wireless network communication of video data, or byaccessing physical data storage media (e.g., a flash drive or harddisk). Video data memory 79 may include a coded picture buffer (CPB)that stores encoded video data from an encoded video bitstream. Decodedpicture buffer (DPB) 92 of video decoder 30 stores reference video datafor use in decoding video data by video decoder 30 (e.g., in intra orinter predictive coding modes). Video data memory 79 and DPB 92 may beformed by any of a variety of memory devices, such as dynamic randomaccess memory (DRAM), including synchronous DRAM (SDRAM),magneto-resistive RAM (MRAM), resistive RAM (RRAM), or other types ofmemory devices. For illustrative purpose, video data memory 79 and DPB92 are depicted as two distinct components of video decoder 30 in FIG. 3. But it will be apparent to one skilled in the art that video datamemory 79 and DPB 92 may be provided by the same memory device orseparate memory devices. In some examples, video data memory 79 may beon-chip with other components of video decoder 30, or off-chip relativeto those components.

During the decoding process, video decoder 30 receives an encoded videobitstream that represents video blocks of an encoded video frame andassociated syntax elements. Video decoder 30 may receive the syntaxelements at the video frame level and/or the video block level. Entropydecoding unit 80 of video decoder 30 entropy decodes the bitstream togenerate quantized coefficients, motion vectors or intra-prediction modeindicators, and other syntax elements. Entropy decoding unit 80 thenforwards the motion vectors and other syntax elements to predictionprocessing unit 81.

When the video frame is coded as an intra predictive coded (I) frame orfor intra coded predictive blocks in other types of frames, intraprediction processing unit 84 of prediction processing unit 81 maygenerate prediction data for a video block of the current video framebased on a signaled intra prediction mode and reference data frompreviously decoded blocks of the current frame.

When the video frame is coded as an inter-predictive coded (i.e., B orP) frame, motion compensation unit 82 of prediction processing unit 81produces one or more predictive blocks for a video block of the currentvideo frame based on the motion vectors and other syntax elementsreceived from entropy decoding unit 80. Each of the predictive blocksmay be produced from a reference frame within one of the reference framelists. Video decoder 30 may construct the reference frame lists, List 0and List 1, using default construction techniques based on referenceframes stored in DPB 92.

In some examples, when the video block is coded according to the intraBC mode described herein, intra BC unit 85 of prediction processing unit81 produces predictive blocks for the current video block based on blockvectors and other syntax elements received from entropy decoding unit80. The predictive blocks may be within a reconstructed region of thesame picture as the current video block defined by video encoder 20.

Motion compensation unit 82 and/or intra BC unit 85 determinesprediction information for a video block of the current video frame byparsing the motion vectors and other syntax elements, and then uses theprediction information to produce the predictive blocks for the currentvideo block being decoded. For example, motion compensation unit 82 usessome of the received syntax elements to determine a prediction mode(e.g., intra or inter prediction) used to code video blocks of the videoframe, an inter prediction frame type (e.g., B or P), constructioninformation for one or more of the reference frame lists for the frame,motion vectors for each inter predictive encoded video block of theframe, inter prediction status for each inter predictive coded videoblock of the frame, and other information to decode the video blocks inthe current video frame.

Similarly, intra BC unit 85 may use some of the received syntaxelements, e.g., a flag, to determine that the current video block waspredicted using the intra BC mode, construction information of whichvideo blocks of the frame are within the reconstructed region and shouldbe stored in DPB 92, block vectors for each intra BC predicted videoblock of the frame, intra BC prediction status for each intra BCpredicted video block of the frame, and other information to decode thevideo blocks in the current video frame.

Motion compensation unit 82 may also perform interpolation using theinterpolation filters as used by video encoder 20 during encoding of thevideo blocks to calculate interpolated values for sub-integer pixels ofreference blocks. In this case, motion compensation unit 82 maydetermine the interpolation filters used by video encoder 20 from thereceived syntax elements and use the interpolation filters to producepredictive blocks.

Inverse quantization unit 86 inverse quantizes the quantized transformcoefficients provided in the bitstream and entropy decoded by entropydecoding unit 80 using the same quantization parameter calculated byvideo encoder 20 for each video block in the video frame to determine adegree of quantization. Inverse transform processing unit 88 applies aninverse transform, e.g., an inverse DCT, an inverse integer transform,or a conceptually similar inverse transform process, to the transformcoefficients in order to reconstruct the residual blocks in the pixeldomain.

After motion compensation unit 82 or intra BC unit 85 generates thepredictive block for the current video block based on the vectors andother syntax elements, summer 90 reconstructs decoded video block forthe current video block by summing the residual block from inversetransform processing unit 88 and a corresponding predictive blockgenerated by motion compensation unit 82 and intra BC unit 85. Anin-loop filter 91 may be positioned between summer 90 and DPB 92 tofurther process the decoded video block. The in-loop filtering 91, suchas deblocking filter, sample adaptive offset (SAO) and adaptive in-loopfilter (ALF) may be applied on the reconstructed CU before it is put inthe reference picture store. The decoded video blocks in a given frameare then stored in DPB 92, which stores reference frames used forsubsequent motion compensation of next video blocks. DPB 92, or a memorydevice separate from DPB 92, may also store decoded video for laterpresentation on a display device, such as display device 34 of FIG. 1 .

In a typical video coding process, a video sequence typically includesan ordered set of frames or pictures. Each frame may include threesample arrays, denoted SL, SCb, and SCr. SL is a two-dimensional arrayof luma samples. SCb is a two-dimensional array of Cb chroma samples.SCr is a two-dimensional array of Cr chroma samples. In other instances,a frame may be monochrome and therefore includes only onetwo-dimensional array of luma samples.

Like the HEVC, the AVS3 standard is built upon the block-based hybridvideo coding framework. The input video signal is processed block byblock (called coding units (CUs)). Different from the HEVC whichpartitions blocks only based on quad-trees, in the AVS3, one coding treeunit (CTU) is split into CUs to adapt to varying local characteristicsbased on quad/binary/extended-quad-tree. Additionally, the concept ofmultiple partition unit type in the HEVC is removed, i.e., theseparation of CU, prediction unit (PU) and transform unit (TU) does notexist in the AVS3. Instead, each CU is always used as the basic unit forboth prediction and transform without further partitions. In the treepartition structure of the AVS3, one CTU is firstly partitioned based ona quad-tree structure. Then, each quad-tree leaf node can be furtherpartitioned based on a binary and extended-quad-tree structure.

As shown in FIG. 4A, video encoder 20 (or more specifically partitionunit 45) generates an encoded representation of a frame by firstpartitioning the frame into a set of coding tree units (CTUs). A videoframe may include an integer number of CTUs ordered consecutively in araster scan order from left to right and from top to bottom. Each CTU isa largest logical coding unit and the width and height of the CTU aresignaled by the video encoder 20 in a sequence parameter set, such thatall the CTUs in a video sequence have the same size being one of128×128, 64×64, 32×32, and 16×16. But it should be noted that thepresent application is not necessarily limited to a particular size. Asshown in FIG. 4B, each CTU may comprise one coding tree block (CTB) ofluma samples, two corresponding coding tree blocks of chroma samples,and syntax elements used to code the samples of the coding tree blocks.The syntax elements describe properties of different types of units of acoded block of pixels and how the video sequence can be reconstructed atthe video decoder 30, including inter or intra prediction, intraprediction mode, motion vectors, and other parameters. In monochromepictures or pictures having three separate color planes, a CTU maycomprise a single coding tree block and syntax elements used to code thesamples of the coding tree block. A coding tree block may be an N×Nblock of samples.

To achieve a better performance, video encoder 20 may recursivelyperform tree partitioning such as binary-tree partitioning, ternary-treepartitioning, quad-tree partitioning or a combination of both on thecoding tree blocks of the CTU and divide the CTU into smaller codingunits (CUs). As depicted in FIG. 4C, the 64×64 CTU 400 is first dividedinto four smaller CU, each having a block size of 32×32. Among the foursmaller CUs, CU 410 and CU 420 are each divided into four CUs of 16×16by block size. The two 16×16 CUs 430 and 440 are each further dividedinto four CUs of 8×8 by block size. FIG. 4D depicts a quad-tree datastructure illustrating the end result of the partition process of theCTU 400 as depicted in FIG. 4C, each leaf node of the quad-treecorresponding to one CU of a respective size ranging from 32×32 to 8×8.Like the CTU depicted in FIG. 4B, each CU may comprise a coding block(CB) of luma samples and two corresponding coding blocks of chromasamples of a frame of the same size, and syntax elements used to codethe samples of the coding blocks. In monochrome pictures or pictureshaving three separate color planes, a CU may comprise a single codingblock and syntax structures used to code the samples of the codingblock. It should be noted that the quad-tree partitioning depicted inFIGS. 4C and 4D is only for illustrative purposes and one CTU can besplit into CUs to adapt to varying local characteristics based onquad/ternary/binary-tree partitions. In the multi-type tree structure,one CTU is partitioned by a quad-tree structure and each quad-tree leafCU can be further partitioned by a binary and ternary tree structure. Asshown in FIG. 4E, there are five splitting/partitioning types in theAVS3, i.e., quaternary partitioning, horizontal binary partitioning,vertical binary partitioning, horizontal extended quad-treepartitioning, and vertical extended quad-tree partitioning.

In some implementations, video encoder 20 may further partition a codingblock of a CU into one or more M×N prediction blocks (PB). A predictionblock is a rectangular (square or non-square) block of samples on whichthe same prediction, inter or intra, is applied. A prediction unit (PU)of a CU may comprise a prediction block of luma samples, twocorresponding prediction blocks of chroma samples, and syntax elementsused to predict the prediction blocks. In monochrome pictures orpictures having three separate color planes, a PU may comprise a singleprediction block and syntax structures used to predict the predictionblock. Video encoder 20 may generate predictive luma, Cb, and Cr blocksfor luma, Cb, and Cr prediction blocks of each PU of the CU.

Video encoder 20 may use intra prediction or inter prediction togenerate the predictive blocks for a PU. If video encoder 20 uses intraprediction to generate the predictive blocks of a PU, video encoder 20may generate the predictive blocks of the PU based on decoded samples ofthe frame associated with the PU. If video encoder 20 uses interprediction to generate the predictive blocks of a PU, video encoder 20may generate the predictive blocks of the PU based on decoded samples ofone or more frames other than the frame associated with the PU.

After video encoder 20 generates predictive luma, Cb, and Cr blocks forone or more PUs of a CU, video encoder 20 may generate a luma residualblock for the CU by subtracting the CU's predictive luma blocks from itsoriginal luma coding block such that each sample in the CU's lumaresidual block indicates a difference between a luma sample in one ofthe CU's predictive luma blocks and a corresponding sample in the CU'soriginal luma coding block. Similarly, video encoder 20 may generate aCb residual block and a Cr residual block for the CU, respectively, suchthat each sample in the CU's Cb residual block indicates a differencebetween a Cb sample in one of the CU's predictive Cb blocks and acorresponding sample in the CU's original Cb coding block and eachsample in the CU's Cr residual block may indicate a difference between aCr sample in one of the CU's predictive Cr blocks and a correspondingsample in the CU's original Cr coding block.

Furthermore, as illustrated in FIG. 4C, video encoder 20 may usequad-tree partitioning to decompose the luma, Cb, and Cr residual blocksof a CU into one or more luma, Cb, and Cr transform blocks. A transformblock is a rectangular (square or non-square) block of samples on whichthe same transform is applied. A transform unit (TU) of a CU maycomprise a transform block of luma samples, two corresponding transformblocks of chroma samples, and syntax elements used to transform thetransform block samples. Thus, each TU of a CU may be associated with aluma transform block, a Cb transform block, and a Cr transform block. Insome examples, the luma transform block associated with the TU may be asub-block of the CU's luma residual block. The Cb transform block may bea sub-block of the CU's Cb residual block. The Cr transform block may bea sub-block of the CU's Cr residual block. In monochrome pictures orpictures having three separate color planes, a TU may comprise a singletransform block and syntax structures used to transform the samples ofthe transform block.

Video encoder 20 may apply one or more transforms to a luma transformblock of a TU to generate a luma coefficient block for the TU. Acoefficient block may be a two-dimensional array of transformcoefficients. A transform coefficient may be a scalar quantity. Videoencoder 20 may apply one or more transforms to a Cb transform block of aTU to generate a Cb coefficient block for the TU. Video encoder 20 mayapply one or more transforms to a Cr transform block of a TU to generatea Cr coefficient block for the TU.

After generating a coefficient block (e.g., a luma coefficient block, aCb coefficient block or a Cr coefficient block), video encoder 20 mayquantize the coefficient block. Quantization generally refers to aprocess in which transform coefficients are quantized to possibly reducethe amount of data used to represent the transform coefficients,providing further compression. After video encoder 20 quantizes acoefficient block, video encoder 20 may entropy encode syntax elementsindicating the quantized transform coefficients. For example, videoencoder 20 may perform Context-Adaptive Binary Arithmetic Coding (CABAC)on the syntax elements indicating the quantized transform coefficients.Finally, video encoder 20 may output a bitstream that includes asequence of bits that forms a representation of coded frames andassociated data, which is either saved in storage device 32 ortransmitted to destination device 14.

After receiving a bitstream generated by video encoder 20, video decoder30 may parse the bitstream to obtain syntax elements from the bitstream.Video decoder 30 may reconstruct the frames of the video data based atleast in part on the syntax elements obtained from the bitstream. Theprocess of reconstructing the video data is generally reciprocal to theencoding process performed by video encoder 20. For example, videodecoder 30 may perform inverse transforms on the coefficient blocksassociated with TUs of a current CU to reconstruct residual blocksassociated with the TUs of the current CU. Video decoder 30 alsoreconstructs the coding blocks of the current CU by adding the samplesof the predictive blocks for PUs of the current CU to correspondingsamples of the transform blocks of the TUs of the current CU. Afterreconstructing the coding blocks for each CU of a frame, video decoder30 may reconstruct the frame.

SAO is a process that modifies the decoded samples by conditionallyadding an offset value to each sample after the application of thedeblocking filter, based on values in look-up tables transmitted by theencoder. SAO filtering is performed on a region basis, based on afiltering type selected per CTB by a syntax element sao-type-idx. Avalue of 0 for sao-type-idx indicates that the SAO filter is not appliedto the CTB, and the values 1 and 2 signal the use of the band offset andedge offset filtering types, respectively. In the band offset modespecified by sao-type-idx equal to 1, the selected offset value directlydepends on the sample amplitude. In this mode, the full sample amplituderange is uniformly split into 32 segments called bands, and the samplevalues belonging to four of these bands (which are consecutive withinthe 32 bands) are modified by adding transmitted values denoted as bandoffsets, which can be positive or negative. The main reason for usingfour consecutive bands is that in the smooth areas where bandingartifacts can appear, the sample amplitudes in a CTB tend to beconcentrated in only few of the bands. In addition, the design choice ofusing four offsets is unified with the edge offset mode of operationwhich also uses four offset values. In the edge offset mode specified bysao-type-idx equal to 2, a syntax element sao-eo-class with values from0 to 3 signals whether a horizontal, vertical or one of two diagonalgradient directions is used for the edge offset classification in theCTB.

FIG. 5 is a block diagram depicting the four gradient patterns used inSAO in accordance with some implementations of the present disclosure.The four gradient patterns 502, 504, 506, and 508 are for the respectivesao-eo-class in the edge offset mode. Sample labelled “p” indicates acenter sample to be considered. Two samples labeled “n0” and “n1”specify two neighboring samples along the (a) horizontal(sao-eo-class=0), (b) vertical (sao-eo-class=1), (c) 135° diagonal(sao-eo-class=2), and (d) 45° (sao-eo-class=3) gradient patterns. Eachsample in the CTB is classified into one of five EdgeIdx categories bycomparing the sample value p located at some position with the values n0and n1 of two samples located at neighboring positions as shown in FIG.5 . This classification is done for each sample based on decoded samplevalues, so no additional signaling is required for the EdgeIdxclassification. Depending on the EdgeIdx category at the sampleposition, for EdgeIdx categories from 1 to 4, an offset value from atransmitted look-up table is added to the sample value. The offsetvalues are always positive for categories 1 and 2 and negative forcategories 3 and 4. Thus the filter generally has a smoothing effect inthe edge offset mode. Table 1 below illustrates a sample EdgeIdxcategories in SAO edge classes.

TABLE 1 A sample EdgeIdx categories in SAO edge classes. EdgeIdxCondition Meaning 0 Cases not listed below Monotonic area 1 p < n₀ and p= n₁ Local min 2 p < n₀ and p = n₁ or Edge p < n₁ and p = n₀ 3 p > n₀and p = n₁ or Edge p > n₁ and p = n₀ 4 p > n₀ and p > n₁ Local max

For SAO types 1 and 2, a total of four amplitude offset values aretransmitted to the decoder for each CTB. For type 1, the sign is alsoencoded. The offset values and related syntax elements such assao-type-idx and sao-eo-class are determined by the encoder—typicallyusing criteria that optimize rate-distortion performance. The SAOparameters can be indicated to be inherited from the left or above CTBusing a merge flag to make the signaling efficient. In summary, SAO is anonlinear filtering operation which allows additional refinement of thereconstructed signal, and it can enhance the signal representation inboth smooth areas and around edges.

In some embodiments, methods and systems are disclosed herein to improvethe coding efficiency or reduce the complexity of Sample Adaptive Offset(SAO) by introducing cross-component information. SAO is used in theHEVC, VVC, AVS2 and AVS3 standards. Although the existing SAO design inthe HEVC, VVC, AVS2 and AVS3 standards is used as the basic SAO methodin the following descriptions, to a person skilled in the art of videocoding, the cross-component methods described in the disclosure can alsobe applied to other loop filter designs or other coding tools with thesimilar design spirits. For example, in the AVS3 standard, SAO isreplaced by a coding tool called Enhanced Sample Adaptive Offset (ESAO).However, the CCSAO disclosed herein can also be applied in parallel withESAO. In another example, CCSAO can be applied in parallel withConstrained Directional Enhancement Filter (CDEF) in the AV1 standard.

For the existing SAO design in the HEVC, VVC, AVS2 and AVS3 standards,the luma Y, chroma Cb and chroma Cr sample offset values are decidedindependently. That is, for example, the current chroma sample offset isdecided by only the current and neighboring chroma sample values,without taking collocated or neighboring luma samples intoconsideration. However, luma samples preserve more original picturedetail information than chroma samples, and they can benefit thedecision of the current chroma sample offset. Furthermore, since chromasamples usually lose high frequency details after color conversion fromRGB to YCbCr, or after quantization and deblocking filter, introducingluma samples with high frequency detail preserved for chroma offsetdecision can benefit the chroma sample reconstruction. Hence, furthergain can be expected by exploring cross-component correlation, forexample, by using the methods and systems of Cross-Component SampleAdaptive Offset (CCSAO).

FIG. 6A is a block diagram illustrating the system and process of CCSAOaccording to some implementations of the present disclosure. The lumasamples after luma deblocking filter (DBF Y) is used to determineadditional offsets for chroma Cb and Cr after SAO Cb and SAO Cr. Forexample, the current chroma sample 602 is first classified usingcollocated 604 and neighboring (white) luma samples 606, and thecorresponding CCSAO offset value of the corresponding class is added tothe current chroma sample value.

In some embodiments, CCSAO can also be applied in parallel with othercoding tools, for example, ESAO in the AVS standard, or CDEF in the AV1standard. FIG. 6B is a block diagram illustrating the system and processof CCSAO applied in parallel with ESAO in the AVS standard according tosome implementations of the present disclosure.

FIG. 6C is a block diagram illustrating the system and process of CCSAOapplied after SAO according to some implementations of the presentdisclosure. In some embodiments, FIG. 6C shows that the location ofCCSAO can be after SAO, i.e., the location of Cross-Component AdaptiveLoop Filter (CCALF) in the VVC standard. In some embodiments, the SAOY/Cb/Cr can be replaced by ESAO, for example, in the AVS3 standard.

FIG. 6D is a block diagram illustrating the system and process of CCSAOapplied in parallel with CCALF according to some implementations of thepresent disclosure. In some embodiments, FIG. 6D shows that CCSAO can beapplied in parallel with CCALF. In some embodiments, in FIG. 6D, thelocations of CCALF and CCSAO can be switched. In some embodiments, inFIG. 6A to FIG. 6D, or throughout the present disclosure, the SAOY/Cb/Cr blocks can be replaced by ESAO Y/Cb/Cr (in AVS3) or CDEF (inAV1).

In some embodiments, the current chroma sample classification is reusingthe SAO type (EO or BO), class, and category of the collocated lumasample. The corresponding CCSAO offset can be signaled or derived fromthe decoder itself. For example, let h_Y be the collocated luma SAOoffset, h_Cb and h_Cr be the CCSAO Cb and Cr offset, respectively. h_Cb(or h_Cr)=w*h_Y where w can be selected in a limited table. For example,+−¼, +−½, 0, +−1, +−2, +−4 . . . etc., where |w| only includes thepower-of-2 values.

In some embodiments, the comparison score [−8, 8] of the collocated lumasamples (Y0) and neighboring 8 luma samples are used, which yields 17classes in total.

Initial Class = 0 Loop over neighboring 8 luma samples (Yi, i = 1 to 8) if Y0 > Yi Class += 1  else if Y0 < Yi Class −= 1

In some embodiments, the abovementioned classification methods can becombined. For example, comparison score combined with SAO BO (32 bandsclassification) is used to increase diversity, which yields 17*32classes in total. In some embodiments, the Cb and Cr can use the sameclass to reduce the complexity or saving bits.

FIG. 7 is a block diagram illustrating a sample process using CCSAO inaccordance with some implementations of the present disclosure.Specifically, FIG. 7 shows the input of CCSAO can introduce the input ofvertical and horizontal DBF, to simplify the class determination, orincrease flexibility. For example, let Y0_DBF_V, Y0_DBF_H, and Y0 becollocated luma samples at the input of DBF_V, DBF_H, and SAO,respectively. Yi_DBF_V, Yi_DBF_H, and Yi are neighbouring 8 luma samplesat the input of DBF_V, DBF_H, and SAO, respectively, where i=1 to 8.

Max Y0=max(Y0_DBF_V,Y0_DBF_H,Y0_DBF)

Max Yi=max(Yi_DBF_V,Yi_DBF_H,Yi_DBF)

And feed max Y0 and max Yi to CCSAO classification.

FIG. 8 is a block diagram illustrating that CCSAO process is interleavedto vertical and horizontal DBF in accordance with some implementationsof the present disclosure. In some embodiments, CCSAO blocks in FIGS. 6,7 and 8 can be selective. For example, using Y0_DBF_V and Yi_DBF_V forthe first CCSAO_V, which applies the same sample processing as in FIG. 6, while using the input of DBF_V luma samples as CCSAO input.

In some embodiments, CCSAO syntax implemented is shown in Table 2 below.

TABLE 2 An example of CCSAO syntax Level Syntax element Meaning SPScc_sao_enabled_flag whether CCSAO is enabled in the sequence SHslice_cc_sao_cb_flag whether CCSAO is enabled for slice_cc_sao_cr_flagCb or Cr CTU cc_sao_merge_left_flag whether CCSAO offset is mergedcc_sao_merge_up_flag from the left or up CTU CTU cc_sao_class_idx CCSAOclass index of this CTU CTU cc_sao_offset_sign_flag CCSAO Cb and Croffset values cc_sao_offset_abs of this CTU class

In some embodiments, for signaling CCSAO Cb and Cr offset values, if oneadditional chroma offset is signaled, the other chroma component offsetcan be derived by plus or minus sign, or weighting to save bitsoverhead. For example, let h_Cb and h_Cr be the offset of CCSAO Cb andCr, respectively. With explicit signaling w, wherein w=+−|w| withlimited |w| candidates, h_Cr can be derived from h_Cb without explicitsignaling h_Cr itself.

h_Cr=w*h_Cb

FIG. 9 is a flowchart illustrating an exemplary process 900 of decodingvideo signal using cross-component correlation in accordance with someimplementations of the present disclosure.

The video decoder 30, receives the video signal that includes a firstcomponent and a second component (910). In some embodiments, the firstcomponent is a luma component, and the second component is a chromacomponent of the video signal.

The video decoder 30 also receives a plurality of offsets associatedwith the second component (920).

The video decoder 30 then utilizes a characteristic measurement of thefirst component to obtain a classification category associated with thesecond component (930). For example, in FIG. 6 , the current chromasample 602 is first classified using collocated 604 and neighboring(white) luma samples 606, and the corresponding CCSAO offset value isadded to the current chroma sample.

The video decoder 30 further selects a first offset from the pluralityof offsets for the second component according to the classificationcategory (940).

The video decoder 30 additionally modifies the second component based onthe selected first offset (950).

In some embodiments, utilizing the characteristic measurement of thefirst component to obtain the classification category associated withthe second component (930) includes: utilizing a respective sample ofthe first component to obtain a respective classification category of arespective each sample of the second component, wherein the respectivesample of the first component is a respective collocated sample of thefirst component to the respective each sample of the second component.For example, the current chroma sample classification is reusing the SAOtype (EO or BO), class, and category of the collocated luma sample.

In some embodiments, utilizing the characteristic measurement of thefirst component to obtain the classification category associated withthe second component (930) includes: utilizing a respective sample ofthe first component to obtain a respective classification category of arespective each sample of the second component, wherein the respectivesample of the first component is reconstructed before being deblocked oris reconstructed after being deblocked. In some embodiment, the firstcomponent is being deblocked at a deblocking filter (DBF). In someembodiment, the first component is being deblocked at a luma deblockingfilter (DBF Y). For example, alternative to FIG. 6 or 7 , the CCSAOinput can also be before DBF Y.

In some embodiments, the characteristic measurement is derived bydividing the range of sample values of the first component into severalbands and selecting a band based on the intensity value of a sample inthe first component. In some embodiments, the characteristic measurementis derived from Band Offset (BO).

In some embodiments, the characteristic measurement is derived based onthe direction and strength of the edge information of a sample in thefirst component. In some embodiments, the characteristic measurement isderived from Edge Offset (EO).

In some embodiments, modifying the second component (950) comprisesdirectly adding the selected first offset to the second component. Forexample, the corresponding CCSAO offset value is added to the currentchroma component sample.

In some embodiments, modifying the second component (950) comprisesmapping the selected first offset to a second offset and adding themapped second offset to the second component. For example, for signalingCCSAO Cb and Cr offset values, if one additional chroma offset issignaled, the other chroma component offset can be derived by using aplus or minus sign, or weighting to save bits overhead.

In some embodiments, receiving the video signal (910) comprisesreceiving a syntax element that indicates whether the method of decodingvideo signal using CCSAO is enabled for the video signal in the SequenceParameter Set (SPS). In some embodiments, cc_sao_enabled_flag indicateswhether CCSAO is enabled in the sequence level.

In some embodiments, receiving the video signal (910) comprisesreceiving a syntax element that indicates whether the method of decodingvideo signal using CCSAO is enabled for the second component on theslice level. In some embodiments, slice_cc_sao_cb_flag orslice_cc_sao_cr_flag indicates whether CCSAO is enabled in therespective slice for Cb or Cr.

In some embodiments, receiving the plurality of offsets associated withthe second component (920) comprises receiving different offsets fordifferent Coding Tree Units (CTUs). In some embodiments, for a CTU,cc_sao_offset_sign_flag indicates a sign for an offset, andcc_sao_offset_abs indicates the CCSAO Cb and Cr offset values of thecurrent CTU.

In some embodiments, receiving the plurality of offsets associated withthe second component (920) comprises receiving a syntax element thatindicates whether the received offsets of a CTU are the same as that ofone of a neighboring CTU of the CTU, wherein the neighboring CTU iseither a left or a top neighboring CTU. For example,cc_sao_merge_up_flag indicates whether CCSAO offset is merged from theleft or up CTU.

In some embodiments, the video signal further includes a third componentand the method of decoding the video signal using CCSAO furtherincludes: receiving a second plurality of offsets associated with athird component; utilizing the characteristic measurement of the firstcomponent to obtain a second classification category associated with thethird component; selecting a third offset from the second plurality ofoffsets for the third component according to the second classificationcategory; and modifying the third component based on the selected thirdoffset.

FIG. 11 is a block diagram of a sample process illustrating that besidesluma, the other cross-component collocated (1102) and neighboring(white) chroma samples are also fed into CCSAO classification inaccordance with some implementations of the present disclosure. FIG. 6A,6B and FIG. 11 show the input of CCSAO classification. In FIG. 11 ,current chroma sample is 1104, the cross-component collocated chromasample is 1102, and the collocated luma sample is 1106.

In some embodiments, a classifier example (C0) uses the collocated lumasample value (Y0) for classification. Let band_num be the number ofequally divided bands of luma dynamic range, and bit_depth be thesequence bit depth, the class index for the current chroma sample is:

Class (C0)=(Y0*band_num)>>bit_depth

In some embodiments, the classification takes rounding into account, forexample:

Class (C0)=((Y0*band_num)+(1<<bit_depth))>>bit_depth

Some band_num and bit_depth examples are listed below in Table 3. Table3 shows three classification examples when the number of bands isdifferent for each of the classification examples.

TABLE 3 Exemplary band_num and bit_depth for each class index. band_num16 bit_depth 10 Class Y0 0 0 63 1 64 127 2 128 191 3 192 255 4 256 319 5320 383 6 384 447 7 448 511 8 512 575 9 576 639 10 640 703 11 704 767 12768 831 13 832 895 14 896 959 15 960 1023 band_num 7 bit_depth 10 ClassY0 0 0 145 1 146 292 2 293 438 3 439 584 4 585 730 5 731 877 6 878 1023band_num 7 bit_depth 8 Class Y0 0 0 36 1 37 72 2 73 109 3 110 145 4 146182 5 183 218 6 219 255

In some embodiments, a classifier uses different luma sample positionfor C0 classification. FIG. 10A is a block diagram showing a classifierusing different luma sample position for C0 classification in accordancewith some implementations of the present disclosure, for example, usingthe neighboring Y7 but not Y0 for C0 classification.

In some embodiments, different classifiers can be switched in SequenceParameter Set (SPS)/Adaptation parameter set (APS)/Picture parameter set(PPS)/Picture header (PH)/Slice header (SH)/Coding tree unit(CTU)/Coding unit (CU) levels. For example, in FIG. 10 , using Y0 forPOC0 but using Y7 for POC1, as shown in Table 4 below.

TABLE 4 Different classifiers are applied to different pictures POCClassifier C0 band_num Total classes 0 C0 using Y0 position 8 8 1 C0using Y7 position 8 8

In some embodiments, FIG. 10B illustrates some examples of differentshapes for luma candidates, in accordance with some implementations ofthe present disclosure. For example, a constraint can be applied to theshapes. In some instances, the total number of luma candidates must bethe power of 2, as shown in FIG. 10B (b) (c) (d). In some instances, thenumber of luma candidates must be horizontal and vertical symmetricrelative to the chroma sample (in the center), as shown in FIG. 10B (a)(c) (d) (e).

In some embodiments, the C0 position and C0 band_num can be combined andswitched in SPS/APS/PPS/PH/SH/CTU/CU levels. Different combinations canbe different classifiers as shown in Table 5 below.

TABLE 5 Different classifier and band number combinations are applied todifferent pictures POC Classifier C0 band_num Total classes 0 C0 usingY0 position 16 16 1 C0 using Y7 position 8 8

In some embodiments, the collocated luma sample value (Y0) is replacedby a value (Yp) obtained by weighing collocated and neighboring lumasamples. FIG. 12 illustrates exemplary classifiers by replacing thecollocated luma sample value with a value obtained by weighingcollocated and neighboring luma samples in accordance with someimplementations of the present disclosure. The collocated luma samplevalue (Y0) can be replaced by a phase corrected value (Yp) obtained byweighing neighboring luma samples. Different Yp can be a differentclassifier.

In some embodiments, different Yp is applied on different chroma format.For example, in FIG. 12 , the Yp of (a) is used for the 420 chromaformat, the Yp of (b) is used for the 422 chroma format, and Y0 is usedfor the 444 chroma format.

In some embodiments, another classifier (C1) is the comparison score[−8, 8] of the collocated luma samples (Y0) and neighboring 8 lumasamples, which yields 17 classes in total as shown below.

Initial Class (C1) = 0, Loop over neighboring 8 luma samples (Yi, i = 1to 8)  if Y0 > Yi Class += 1  else if Y0 < Yi Class −= 1

In some embodiments, a variation (C1′) only counts comparison score [0,8], and this yields 8 classes. (C1, C1′) is a classifier group and aPH/SH level flag can be signaled to switch between C1 and C1′.

Initial Class (C1′) = 0, Loop over neighboring 8 luma samples (Yi, i = 1to 8)  if Y0 > Yi Class += 1

In some embodiments, different classifiers are combined to yield ageneral classifier. For example, for different pictures (different POCvalues), different classifiers are applied as shown in Table 6-1 below.

TABLE 6-1 Different general classifiers are applied to differentpictures POC Classifier C0 band_num Total classes 0 combine C0 and C1 1616*17 1 combine C0 and C1′ 16 16*9  2 combine C0 and C1 7  7*17

In some embodiments, another classifier example (C3) is using a bitmaskfor classification as shown in Table 6-2. A 10-bit bitmask is signaledin SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock levels to indicate theclassifier. For example, bitmask 11 1100 0000 means that for a given10-bit luma sample value, only most significant bit (MSB): 4 bits areused for classification, and that yields 16 classes in total. Anotherexample bitmask 10 0100 0001 means that only 3 bits are used forclassification, and that yields 8 classes in total.

In some embodiments, the luma position and C3 bitmask can be combinedand switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock levels.Different combinations can be different classifiers.

In some embodiments, a “max number of is” of the bitmask restriction canbe applied to restrict the corresponding number of offsets. For example,restricting “max number of is” of the bitmask to 4 in SPS, and thatyields the max offsets in the sequence to be 16. The bitmask indifferent POC can be different, but the “max number of is” shall notexceed 4 (total classes shall not exceed 16). The “max number of is”value can be signaled and switched inSPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock levels.

TABLE 6-2 Classifier example uses a bitmask for classification (bit maskposition is underscored) POC Classifier C3 10-bit bitmask Total classes0 C3 using Y0 11 1100 0000 16 position Luma sample value Class index 000000 1111  0 (0000) 10 1011 0011  9 (1010) 11 1100 1001 15 (1111) 1 C3using Y4 10 0100 0001 8 position Luma sample value Class index 00 00001111 1 (001) 10 1011 0011 5 (101) 11 1100 1001 7 (111)

All abovementioned classifies (C0, C1, C1′, C2, C3) can be combined. Forexample, see Table 6-3 below.

TABLE 6-3 Different classifiers are combined POC Classifier Totalclasses 0 Combine C0, C0 band_num: C2 band_num: 4*17*4 C1 and C2 4 4 1Combine C0, C0 band_num: C2 band_num: 6*9*4 C1′ and C2 6 4 2 Combine C1C3 Number of 16*17 and C3 1s: 4

In some embodiments, a classifier example (C2) uses the difference (Yn)of collocated and neighboring luma samples. FIG. 12 (c) shows an exampleof Yn, which has a dynamic range of [−1024, 1023] when bit depth is 10.Let C2 band_num be the number of equally divided bands of Yn dynamicrange,

Class(C2)=(Yn+(1<<bit_depth)*band_num)>>(bit-depth+1).

In some embodiments, C0 and C2 are combined to yield a generalclassifier. For example, for different pictures (different POC),different classifiers are applied as shown in Table 7 below.

TABLE 7 Different general classifiers are applied to different picturesC0 C2 Total POC Classifier band_num band_num classes 0 combine C0 and C216 16 16*17 1 combine C0 and C2 8 7 8*7

In some embodiments, all above mentioned classifiers (C0, C1, C1′, C2)are combined. For example, for different pictures (different POCs),different classifiers are applied as shown in Table 8 below.

TABLE 8 Different general classifiers are applied to different picturesPOC Classifier C0 band_num C2 band_num Total classes 0 combine C0, 4 44*17*4 C1 and C2 1 combine C0, 6 4 6*9*4  C1′ and C2

In some embodiments, plural classifiers are used in the same POC. Thecurrent frame is divided by several regions, and each region uses thesame classifier. For example, 3 different classifiers are used in POC0,and which classifier (0, 1, or 2) is used is signaled in CTU level asshown in Table 9 below.

TABLE 9 Different general classifiers are applied to different regionsin the same picture POC Classifier C0 band_num Region 0 C0 using Y0position 16 0 0 C0 using Y0 position 8 1 0 C0 using Y1 position 8 2

In some embodiments, the maximum number of plural classifiers (pluralclassifiers can also be called alternative offset sets) can be fixed orsignaled in SPS/APS/PPS/PH/SH/CTU/CU levels. In one example, the fixed(pre-defined) maximum number of plural classifiers is 4. In that case, 4different classifiers are used in POC0, and which classifier (0, 1, or2) is used is signaled in the CTU level. Truncated-unary (TU) code canbe used to indicate the classifier used for each chroma CTB. Forexample, as shown in Table 10 below, when TU code is 0: CCSAO is notapplied; when TU code is 10: set 0 is applied; when TU code is 110, set1 is applied; when TU code is 1110: set 2 is applied; when TU code is1111: set 3 is applied. Fixed-length code, golomb-rice code, andexponential-golomb code can also be used to indicate the classifier(offset set index) for CTB. 3 different classifiers are used in POC1.

TABLE 10 Truncated-unary (TU) code is used to indicate the classifierused for each chroma CTB POC Classifier C0 band_num Region TU code 0 C0using Y3 position 6 0 10 0 C0 using Y3 position 7 1 110 0 C0 using Y1position 3 2 1110 0 C0 using Y6 position 6 3 1111 1 C0 using Y0 position16 0 10 1 C0 using Y0 position 8 1 110 1 C0 using Y1 position 8 2 1110

An example of Cb and Cr CTB offset set indices is given for 1280×720sequence POC0 (number of CTUs in a frame is 10×6 if the CTU size is128×128). POC0 Cb uses 4 offset sets and Cr uses 1 offset set. As shownin Table 11 below, when the offset set index is 0: CCSAO is not applied;when the offset set index is 1: set 0 is applied; when the offset setindex is 2: set 1 is applied; when the offset set index is 3: set 2 isapplied; when the offset set index is 4: set 3 is applied. Type meansthe position of the chosen collocated luma sample (Yi). Different offsetsets can have different types, band_num and corresponding offsets.

TABLE 11 An example of Cb and Cr CTB offset set indices is given for1280 × 720 sequence POC0 (number of CTUs in a frame is 10 × 6 if the CTUsize is 128 × 128) ccsao_on_frame POC: 0, TID: 0, comp: 0, on: 1,lcu_ctrl: 1, set_num: 4, set: 0, type: 3, band_num: 6 ccsao_on_framePOC: 0, TID: 0, comp: 0, on: 1, lcu_ctrl: 1, set_num: 4, set: 1, type:3, band_num: 7 ccsao_on_frame POC: 0, TID: 0, comp: 0, on: 1, lcu_ctrl:1, set_num: 4, set: 2, type: 1, band_num: 3 ccsao_on_frame POC: 0, TID:0, comp: 0, on: 1, lcu_ctrl: 1, set_num: 4, set: 3, type: 6, band_num: 6ccsao_on_frame POC: 0, TID: 0, comp: 1, on: 1, lcu_ctrl: 0, set_num: 1,set: 0, type: 8, band_num: 10 1 0 2 2 0 0 1 2 0 0   1 1 1 1 1 1 1 1 1 10 0 0 0 1 1 1 1 2 4   1 1 1 1 1 1 1 1 1 11 1 4 1 3 1 1 2 2 1   1 1 1 1 1 1 1 1 1 14 3 1 1 4 2 1 1 1 4   1 1 1 1 1 1 1 1 1 10 0 3 1 1 1 1 2 1 3   1 1 1 1 1 1 1 1 1 10 0 3 3 3 1 1 3 4 1   1 1 1 1 1 1 1 1 1 1 offset [ 0]   0:    6|   0 |  −1 |   2 |  V: −2 | offset [ 1]   0:    2|   1 |  −7 |   0 |  V:   0 | offset [ 2]   0:    0| −1 |  −6 | −2 |  V:   0 | offset [ 3]   0:  −2|   2 |    0 | −1 |  V:   0 | offset [ 4]   0:  −3|   2 |    0 | −1 |  V:   0 | offset [ 5]   0:  −4|   1 |    0 | −7 |  V:   1 | offset [ 6]   0:     |     |      |     |  V:   0 | offset [ 7]   0:     |     |      |     |  V:   0 | offset [ 8]   0:     |     |      |     |  V:   0 | offset [ 9]   0:     |     |      |     |  V: −4 | offset [ 10]   0:     |     |      |     |  V:     | offset [ 11]   0:     |     |      |     |  V:     | offset [ 12]   0:     |     |      |     |  V:     | offset [ 13]   0:     |     |      |     |  V:     | offset [ 14]   0:     |     |      |     |  V:     | offset [ 15]   0:     |     |      |     |  V:     |

In some embodiments, the maximum band_num can be fixed or signaled inSPS/APS/PPS/PH/SH/CTU/CU levels. For example, fixing max band_num=16 inthe decoder and for each frame, 4 bits are signaled to indicate the C0band_num in a frame. Some other maximum band_num examples are listedbelow in Table 12.

TABLE 12 Maximum band_num and band_num bit examples Band_num_minBand_num_max Band_num bit 1 1 0 1 2 1 1 4 2 1 8 3 1 16 4 1 32 5 1 64 6 1128 7 1 256 8

In some embodiments, a restriction can be applied on the C0classification, for example, restricting band_num to be only power of 2values. Instead of explicitly signaling band_num, a syntaxband_num_shift is signaled. Decoder can use shift operation to avoidmultiplication.

Class(C0)=(Y0>>band_num_shift)>>bit_depth

Another operation example is taking rounding into account to reduceerror.

Class(C0)=((Y0+(1<<(band_num_shift−1)))>>band_num_shift)>>bit_depth

For example, if band_num_max is 16, the possible band_num_shiftcandidates are 0, 1, 2, 3, 4, corresponding to band_num=1, 2, 4, 8, 16,as shown in Table 13.

TABLE 13 Band_num and corresponding band_num_shift candidates C0 band_C0 num_ band_ Total POC Classifier shift num classes 0 C0 using Y0 4 1616 position 1 C0 using Y7 3 8 8 position Band_num_ Valid band_ max numBand_num_shift candidates 1 1 0 2 1, 2 0, 1 4 1, 2, 4 0, 1, 2 8 1, 2, 4,8 0, 1, 2, 3 16 1, 2, 4, 8, 16 0, 1, 2, 3, 4 32 1, 2, 4, 8, 16, 0, 1, 2,3, 4, 5 32 64 1, 2, 4, 8, 16, 0, 1, 2, 3, 4, 5, 6 32, 64 128 1, 2, 4, 8,16, 0, 1, 2, 3, 4, 5, 6, 7 32, 64, 128 256 1, 2, 4, 8, 16, 0, 1, 2, 3,4, 5, 6, 7, 8 32, 64, 128, 256

In some embodiments, the classifiers applied to Cb and Cr are different.The Cb and Cr offsets for all classes can be signaled separately. Forexample, different signaled offsets are applied to different chromacomponents as shown in Table 14 below.

TABLE 14 The Cb and Cr offsets for all classes can be signaledseparately POC Component Classifier C0 Total classes Signaled offsets 0Cb C0 16 16 16 0 Cr C0 5 5 5

In some embodiments, the max offset value is fixed or signaled inSequence Parameter Set (SPS)/Adaptation parameter set (APS)/Pictureparameter set (PPS)/Picture header (PH)/Slice header (SH). For example,the max offset is between [−15, 15].

In some embodiments, the offset signaling can use Differentialpulse-code modulation (DPCM). For example, offsets {3, 3, 2, 1, −1} canbe signaled as {3, 0, −1, −1, −2}.

In some embodiments, the offsets can be stored in APS or a memory bufferfor the next picture/slice reuse. An index can be signaled to indicatewhich stored previous frame offsets are used for the current picture.

In some embodiments, the classifiers of Cb and Cr are the same. The Cband Cr offsets for all classes can be signaled jointly, for example, asshown in Table 15 below.

TABLE 15 The Cb and Cr offsets for all classes can be signaled jointlyPOC Component Classifier C0 Total classes Signaled offsets 0 Cb and CrC0 8 8 8

In some embodiments, the classifier of Cb and Cr can be the same. The Cband Cr offsets for all classes can be signaled jointly, with a sign flagdifference, for example, as shown in Table 16 below. According to Table16, when Cb offsets are (3, 3, 2, −1), the derived Cr offsets are (−3,−3, −2, 1).

TABLE 16 The Cb and Cr offsets for all classes can be signaled jointlywith a sign flag difference Com- C0 Total Signaled Signaled POC ponentClassifier band_num classes offsets sign flag 0 Cb and C0 4 4 4: 1: (−)Cr (3, 3, 2, −1)

In some embodiments, the sign flag can be signaled for each class. forexample, as shown in Table 17 below. According to Table 17, when Cboffsets are (3, 3, 2, −1), the derived Cr offsets are (−3, 3, 2, 1)according to the respective signed flag.

TABLE 17 The Cb and Cr offsets for all classes can be signaled jointlywith a sign flag signaled for each class Com- Clas- C0 Total SignaledSignaled POC ponent sifier band_num classes offsets sign flag 0 Cb andC0 4 4 4: 1: Cr (3, 3, 2, −1) (−, +, +, −)

In some embodiments, the classifiers of Cb and Cr can be the same. TheCb and Cr offsets for all classes can be signaled jointly, with a weightdifference, for example, as shown in Table 18 below. The weight (w) canbe selected in a limited table, for example, +−¼, +−½, 0, +−1, +−2, +−4. . . etc., where |w| only includes the power-of-2 values. According toTable 18, when Cb offsets are (3, 3, 2, −1), the derived Cr offsets are(−6, −6, −4, 2) according to the respective signed flag.

TABLE 18 The Cb and Cr offsets for all classes can be signaled jointlywith a weight difference Com- Clas- C0 Total Signaled Signaled POCponent sifier band_num classes offsets weight 0 Cb and C0 4 4 4: −2 Cr(3, 3, 2, −1)

In some embodiments, the weight can be signaled for each class, forexample, as shown in Table 19 below. According to Table 19, when Cboffsets are (3, 3, 2, −1), the derived Cr offsets are (−6, 12, 0, −1)according to the respective signed flag.

TABLE 19 The Cb and Cr offsets for all classes can be signaled jointlywith a weight signaled for each class Com- Clas- C0 Total SignaledSignaled POC ponent sifier band_num classes offsets weight 0 Cb and C0 44 4: 4: Cr (3, 3, 2, −1) (−2, 4, 0, 1)

In some embodiments, if plural classifiers are used in the same POC,different offset sets are signaled separately or jointly.

In some embodiments, the previously decoded offsets can be stored foruse of future frames. An index can be signaled to indicate whichpreviously decoded offsets set is used for the current frame, to reduceoffsets signaling overhead. For example, POC0 offsets can be reused byPOC2 with signaling offsets set idx=0 as shown in Table 20 below.

TABLE 20 An index can be signaled to indicate which previously decodedoffsets set is used for the current frame Stored Com- Clas- C0 TotalSignaled offset POC ponent sifier band_num classes offsets set idx 0 CbC0 4 4 4: 0 (3, 3, 2, −1) 0 Cr C0 4 4 4: 0 (−2, 1, 0, 1) 1 Cb C0 4 4 4:1 (0, 0, 1, −1) 1 Cr C0 4 4 4: 1 (1, 2, 0, 1) 2 Cb C0 4 4 Reuse Signaloffsets idx = 0 (3, 3, 2, −1) 2 Cr C0 4 4 Reuse Signal offsets idx = 0(−2, 1, 0, 1)

In some embodiments, the reuse offsets set idx for Cb and Cr can bedifferent, For example, as shown in Table 21 below.

TABLE 21 An index can be signaled to indicate which previously decodedoffsets set is used for the current frame, and the index can bedifferent for Cb and Cr components. Stored Com- Clas- C0 Total Signaledoffset POC ponent sifier band_num classes offsets set idx 0 Cb C0 4 4 4:0 (3, 3, 2, −1) 0 Cr C0 4 4 4: 0 (−2, 1, 0, 1) 1 Cb C0 4 4 4: 1 (0, 0,1, −1) 1 Cr C0 4 4 4: 1 (1, 2, 0, 1) 2 Cb C0 4 4 Reuse Signal offsetsidx = 0 (3, 3, 2, −1) 2 Cr C0 4 4 Reuse Signal offsets idx = 1 (1, 2, 0,1)

In some embodiments, the offset signaling can use additional syntaxincluding start and length, to reduce signaling overhead. For example,when band_num=256, only offsets of band_idx=37˜44 are signaled. In theexample below in Table 22, the syntax of start and length both are 8bits fixed-length coded that should match band_num bits.

TABLE 22 the offset signaling uses additional syntax including start andlength band_idx offset 1 0 2 0 3 0 . . . 37 start = 37 offset[0] 38offset[1] band_num_ band_num bits, max start, length 39 offset[2] 1 0 40offset[3] 2 1 41 offset[4] 4 2 42 offset[5] 8 3 43 offset[6] 16 4 44length = 8 offset[7] 32 5 . . . 64 6 255 0 128 7 256 0 256 8

In some embodiments, if a sequence bit depth is higher than 10 (or acertain bit depth), the offset can be quantized before signaling. On thedecoder side, the decoded offset is dequantized before applying it asshown in Table 23 below. For example, for a 12-bit sequence, the decodedoffsets are left shifted (dequantized) by 2.

TABLE 23 The decoded offset is dequantized before applying it Signaledoffset Dequantized and applied offset 0 0 1 4 2 8 3 12 . . . 14 56 15 60

In some embodiments, the offset can be calculated asCcSaoOffsetVal=(1−2*ccsao_offset_sign_flag)*(ccsao_offset_abs<<(BitDepth−Min(10,BitDepth)))

In some embodiments, a sample processing is described below. Let R(x, y)be the input chroma sample value before CCSAO, R′(x, y) be the outputchroma sample value after CCSAO:

offset=ccsao_offset[class_index of R(x,y)]

R′(x,y)=Clip3(0,(1<<bit_depth)−1,R(x,y)+offset)

According the above equations, each chroma sample value R(x, y) isclassified using the indicated classifier of the current picture. Thecorresponding offset of the derived class index is added to each chromasample value R(x, y). A clip function Clip 3 is applied to the (R(x,y)+offset) to make the output chroma sample value R′(x, y) within thebit depth dynamic range, for example, range 0 to (1<<bit_depth)−1.

In some embodiments, a boundary processing is described below. If any ofthe collocated and neighboring luma samples used for classification isoutside the current picture, CCSAO is not applied on the current chromasample. FIG. 13A is a block diagram illustrating CCSAO is not applied onthe current chroma sample if any of the collocated and neighboring lumasamples used for classification is outside the current picture inaccordance with some implementations of the present disclosure. Forexample, in FIG. 13A(a), if a classifier is used, CCSAO is not appliedon the left 1 column chroma components of the current picture. Forexample, if C1′ is used, CCSAO is not applied on the left 1 column andthe top 1 row chroma components of the current picture, as shown in FIG.13A(b).

FIG. 13B is a block diagram illustrating CCSAO is applied on the currentchroma sample if any of the collocated and neighboring luma samples usedfor classification is outside the current picture in accordance withsome implementations of the present disclosure. In some embodiments, avariation is, if any of the collocated and neighboring luma samples usedfor classification is outside the current picture, the missed samplesare used repetitively as shown in FIG. 13B(a), or the missed samples aremirror padded to create samples for classification as shown in FIG.13B(b), and CCSAO can be applied on the current chroma samples.

FIG. 14 is a block diagram illustrating CCSAO is not applied on thecurrent chroma sample if a corresponding selected collocated orneighboring luma sample used for classification is outside a virtualspace defined by a virtual boundary in accordance with someimplementations of the present disclosure. In some embodiments, avirtual boundary (VB) is a virtual line that separates the space withina picture frame. In some embodiments, if a virtual boundary (VB) isapplied in the current frame, CCSAO is not applied on the chroma samplesthat have selected corresponding luma position outside a virtual spacedefined by the virtual boundary. FIG. 14 shows an example with a virtualboundary for C0 classifier with 9 luma position candidates. For eachCTU, CCSAO is not applied on the chroma samples for which thecorresponding selected luma position is outside a virtual spacesurrounded by the virtual boundary. For example, in FIG. 14(a), CCSAO isnot applied to the chroma sample 1402 when the selected Y7 luma sampleposition is on the other side of the horizontal virtual boundary 1406which is located 4 pixel lines from the bottom side of the frame. Forexample, in FIG. 14(b), CCSAO is not applied to the chroma sample 1404when the selected Y5 luma sample position is located on the other sideof the vertical virtual boundary 1408 which is located y pixel linesfrom the right side of the frame.

FIG. 15 shows repetitive or mirror padding can be applied on the lumasamples that are outside the virtual boundary in accordance with someimplementations of the present disclosure. FIG. 15 (a) shows an exampleof repetitive padding. If the original Y7 is chosen to be the classifierwhich is located on the bottom side of the VB 1502, the Y4 luma samplevalue is used for classification (copied to the Y7 position), instead ofthe original Y7 luma sample value. FIG. 15 (b) shows an example ofmirror padding. If Y7 is chosen to be the classifier which is located onthe bottom side of the VB 1504, the Y1 luma sample value which issymmetric to the Y7 value relative to the Y0 luma sample is used forclassification, instead of the original Y7 luma sample value. Thepadding methods give more chroma samples possibility to apply CCSAO somore coding gain can be achieved.

In some embodiments, a restriction can be applied to reduce the CCSAOrequired line buffer, and to simplify the boundary processing conditioncheck. FIG. 16 shows additional 1 luma line buffer, i.e., the whole lineluma samples of line −5 above the current VB 1602, may be required ifall 9 collocated neighboring luma samples are used for classification inaccordance with some implementations of the present disclosure. FIG. 10B(a) shows an example using only 6 luma candidates for classification,which reduces the line buffer and does not need any additional boundarycheck in FIG. 13 A and FIG. 13 B.

In some embodiments, using luma samples for CCSAO classification mayincrease the luma line buffer and hence increase the decoder hardwareimplementation cost. FIG. 17 shows an illustration in AVS that 9 lumacandidates CCSAO crossing VB 1702 may increase 2 additional luma linebuffers in accordance with some implementations of the presentdisclosure. For luma and chroma samples above Virtual Boundary (VB)1702, DBF/SAO/ALF are processed at the current CTU row. For luma andchroma samples below VB 1702, DBF/SAO/ALF are processed at the next CTUrow. In AVS decoder hardware design, luma line −4 to −1 pre DBF samples,line −5 pre SAO samples, and chroma line −3 to −1 pre DBF samples, line−4 pre SAO samples are stored as line buffers for next CTU rowDBF/SAO/ALF processing. When processing the next CTU row, luma andchroma samples not in the line buffer are not available. However, forexample, at chroma line −3 (b) position, the chroma sample is processedat the next CTU row, but CCSAO requires pre SAO luma sample lines −7,−6, and −5 for classification. Pre SAO luma sample lines −7, −6 are notin the line buffer so they are not available. And adding pre SAO lumasamples line −7 and −6 to the line buffer will increase the decoderhardware implementation cost. In some examples, luma VB (line −4) andchroma VB (line −3) can be different (not aligned).

Similar as FIG. 17 , FIG. 18 shows an illustration in VVC that 9 lumacandidates CCSAO crossing VB 1802 may increase 1 additional luma linebuffer in accordance with some implementations of the presentdisclosure. VB can be different in different standard. In VVC, luma VBis line −4 and chroma VB is line −2, so 9 candidate CCSAO may increase 1luma line buffer.

In some embodiments, in a first solution, CCSAO is disabled for a chromasample if any of the chroma sample's luma candidates is across VB(outside the current chroma sample VB). FIGS. 19A-19C show in AVS andVVC, CCSAO is disabled for a chroma sample if any of the chroma sample'sluma candidates is across VB 1902 (outside the current chroma sample VB)in accordance with some implementations of the present disclosure. FIG.14 also shows some examples of this implementation.

In some embodiments, in a second solution, repetitive padding is usedfor CCSAO from a luma line close to and on the other side of the VB, forexample, the luma line −4, for “cross VB” luma candidates. FIGS. 20A-20Cshow in AVS and VVC, CCSAO is enabled using repetitive padding for achroma sample if any of the chroma sample's luma candidates is across VB2002 (outside the current chroma sample VB) in accordance with someimplementations of the present disclosure. FIG. 14 (a) also shows someexamples of this implementation.

In some embodiments, in a third solution, mirror padding is used forCCSAO from below luma VB for “cross VB” luma candidates. FIGS. 21A-21Cshow in AVS and VVC, CCSAO is enabled using mirror padding for a chromasample if any of the chroma sample's luma candidates is across VB 2102(outside the current chroma sample VB) in accordance with someimplementations of the present disclosure. FIG. 14 (b) and 13B (b) alsoshow some examples of this implementation.

In some embodiments, in a fourth solution, “double sided symmetricpadding” is used for applying CCSAO. FIGS. 22A-22B show that CCSAO isenabled using double sided symmetric padding for some examples ofdifferent CCSAO shapes (for example, 9 luma candidates (FIG. 22A) and 8luma candidates (FIG. 22B)) in accordance with some implementations ofthe present disclosure. For a luma sample set with a collocated centeredluma sample of a chroma sample, if one side of the luma sample set isoutside the VB 2202, double-sided symmetric padding is applied for bothsides of the luma sample set. For example, in FIG. 22A, luma samples Y0,Y1, and Y2 are outside of the VB 2202, so both Y0, Y1, Y2 and Y6, Y7, Y8are padded using Y3, Y4, Y5. For example, in FIG. 22B, luma sample Y0 isoutside of the VB 2202, so Y0 is padded using Y2, and Y7 is padded usingY5.

The padding methods give more chroma samples possibility to apply CCSAOso more coding gain can be achieved.

In some embodiments. at the bottom picture (or slice, tile, brick)boundary CTU row, the samples below VB are processed at the current CTUrow, so the above special handling (Solution 1, 2, 3, 4) is not appliedat the bottom picture (or slice, tile, brick) boundary CTU row. Forexample, a frame of 1920×1080 is divided by CTUs of 128×128. A framecontains 15×9 CTUs (round up). The bottom CTU row is the 15th CTU row.The decoding process is CTU row by CTU row, and CTU by CTU for each CTUrow. Deblocking needs to be applied along horizontal CTU boundariesbetween the current and next CTU row. CTB VB is applied for each CTU rowsince inside one CTU, at the bottom 4/2 luma/chroma line, DBF samples(VVC case) are processed at the next CTU row and are not available forCCSAO at the current CTU row. However, at the bottom CTU row of thepicture frame, the bottom 4/2 luma/chroma line DBF samples are availableat the current CTU row since there is no next CTU row left and they areDBF processed at the current CTU row.

In some embodiments, a restriction can be applied to reduce the CCSAOrequired line buffer, and to simplify boundary processing conditioncheck as explained in FIG. 16 . FIG. 23 shows the restrictions of usinga limited number of luma candidates for classification in accordancewith some implementations of the present disclosure. FIG. 23 (a) showsthe restriction of using only 6 luma candidates for classification. FIG.23 (b) shows the restriction of using only 4 luma candidates forclassification.

In some embodiments, applied region is implemented. The CCSAO appliedregion unit can be CTB based. That is, the on/off control, CCSAOparameters (offsets, luma candidate positions, band_num, bitmask . . .etc. used for classification, offset set index) are the same in one CTB.

In some embodiments, the applied region can be not aligned to the CTBboundary. For example, the applied region is not aligned to chroma CTBboundary but shifted. The syntaxes (on/off control, CCSAO parameters)are still signaled for each CTB, but the truly applied region is notaligned to the CTB boundary. FIG. 24 shows the CCSAO applied region isnot aligned to the CTB/CTU boundary 2406 in accordance with someimplementations of the present disclosure. For example, the appliedregion is not aligned to chroma CTB/CTU boundary 2406 but top-leftshifted (4, 4) samples to VB 2408. This not-aligned CTB boundary designbenefits the deblocking process since the same deblocking parameters areused for each 8×8 deblocking process region.

In some embodiments, the CCSAO applied region unit (mask size) can bevariant (larger or smaller than CTB size) as shown in Table 24. The masksize can be different for different components. The mask size can beswitched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock levels. Forexample, in PH, a series of mask on/off flags and offset set indices aresignaled to indicate each CCSAO region information.

TABLE 24 CCSAO applied region unit (mask size) can be variant POCComponent CTB size Mask size 0 Cb 64 × 64 128 × 128 0 Cr 64 × 64 32 × 321 Cb 64 × 64 16 × 16 1 Cr 64 × 64 256 × 256

In some embodiments, the CCSAO applied region frame partition can befixed. For example, partition the frame into N regions. FIG. 25 showsthat the CCSAO applied region frame partition can be fixed with CCSAOparameters in accordance with some implementations of the presentdisclosure.

In some embodiments, each region can have its own region on/off controlflag and CCSAO parameters. Also, if the region size is larger than CTBsize, it can have both CTB on/off control flags and region on/offcontrol flag. FIGS. 25 (a) and (b) show some examples of partitioningthe frame into N regions. FIG. 25 (a) shows vertical partitioning of 4regions. FIG. 25 (b) shows square partitioning of 4 regions.

In some embodiments, different CCSAO applied region can share the sameregion on/off control and CCSAO parameters. For example, in FIG. 25 (c),region 0˜2 shares the same parameters and region 3˜15 shares the sameparameters. FIG. 25 (c) also shows the region on/off control flag andCCSAO parameters can be signaled in a Hilbert scan order.

In some embodiments, the CCSAO applied region unit can bequad-tree/binary-tree/ternary-tree split from picture/slice/CTB level.Similar to the CTB split, a series of split flags are signaled toindicate the CCSAO applied region partition. FIG. 26 shows that theCCSAO applied region can be Binary-tree (BT)/Quad-tree (QT)/Ternary-tree(TT) split from frame/slice/CTB level in accordance with someimplementations of the present disclosure.

In some embodiments, CCSAO syntax implemented is shown in Table 25below. In AVS3, the term patch is similar with slice, and patch headeris similar with the slice header. FLC stands for fixed length code. TUstands for truncated unary code. EGk stands for exponential-golomb codewith order k, where k can be fixed.

TABLE 25 A exemplary CCSAO syntax Level Syntax element BinarizationMeaning SPS cc_sao_ FLC whether CCSAO is enabled_flag enabled in thesequence PH/SH ph_cc_sao_ FLC whether CCSAO cb_flag is enabledph_cc_sao_ in this picture/slice for cr_flag Cb/Cr PH/SH ph_cc_ FLCwhich previously sao_stored_ decoded offsets_set_idx offsets set is usedPH/SH ph_cc_sao_cb_ FLC whether to ctb_control_flag enable Cb/Crph_cc_sao_cr_ on/off control ctb_control_flag at CTB level SPS/APS/ph_cc_sao_cb_ FLC adaptively changed PPS/PH/ band_num_minus1 band SH/CTUph_cc_sao_cr_ numbers for band_num_minus1 classification SPS/APS/ph_cc_sao_ FLC Indicating classifier PPS/PH/ cb_type type SH/CTUph_cc_sao_ 1. CCSAO cr_type C1 classifier luma type (C1 or C1′) 2. CCSAOC0 classifier luma position (Y0, Y1 . . . etc.) 3. CCSAO weighted C0classifier (Yp, Yn . . . ) SPS/APS/ cc_sao_cb_ FLC CCSAO Cb PPS/PH/offset_sign_flag TU or EGk and Cr offset SH/CTU cc_sao_cb_ FLC values ofeach class offset_abs TU or EGk cc_sao_cr_offset_ sign_flag cc_sao_cr_offset_abs CTU ctb_cc_sao_ CABAC, 1 whether CCSAO cb_flag or 2 (up & isenabled ctb_cc_sao_ left) for the current Cb cr_flag contexts or Cr CTBCTU ctb_cc_sao_ TU or EGk which CCSAO cb_set_idx offset set isctb_cc_sao_ used for the cr_set_idx current Cb or Cr CTB (if CCSAO isenabled) CTU cc_sao_cb_ CABAC whether CCSAO merge_left_flag offset iscc_sao_cb_ merged from merge_up_flag the left or up cc_sao_cr_ CTUmerge_left_flag cc_sao_cr_ merge_up_flag

If a higher-level flag is off, the lower level flags can be inferredfrom the off state of the flag and do not need to be signaled. Forexample, if ph_cc_sao_cb_flag is false in this picture,ph_cc_sao_cb_band_num_minus1, ph_cc_sao_cb_luma_type,cc_sao_cb_offset_sign_flag, cc_sao_cb_offset_abs, ctb_cc_sao_cb_flag,cc_sao_cb_merge_left_flag, and cc_sao_cb_merge_up_flag are not presentand inferred to be false.

In some embodiments, the SPS ccsao_enabled_flag is conditioned on theSPS SAO enabled flag as shown in Table 26 below.

TABLE 26 the SPS ccsao_enabled_flag is conditioned on the SPS SAOenabled flag sps_sao_enabled_flag u(1) if( sps_sao_enabled_flag &&ChromaArrayType != 0 )  sps_ccsao_enabled_flag u(1) sps_alf_enabled_flagu(1) if( sps_alf_enabled_flag && ChromaArrayType != 0 ) sps_ccalf_enabled_flag u(1)

In some embodiments, ph_cc_sao_cb_ctb_control_flag,ph_cc_sao_cr_ctb_control_flag indicate whether to enable Cb/Cr CTBon/off control granularity. If ph_cc_sao_cb_ctb_control_flag,ph_cc_sao_cr_ctb_control_flag are enabled, ctb_cc_sao_cb_flag andctb_cc_sao_cr_flag can be further signaled. Otherwise, whether CCSAO isapplied in the current picture depends on ph_cc_sao_cb_flag,ph_cc_sao_cr_flag, without further signaling ctb_cc_sao_cb_flag andctb_cc_sao_cr_flag at CTB level.

In some embodiments, for ph_cc_sao_cb_type and ph_cc_sao_cr_type, a flagcan be further signaled to distinguish if the center collocated lumaposition is used (Y0 position in FIG. 10 ) for classification for achroma sample, to reduce bit overhead. Similarly, if cc_sao_cb_type andcc_sao_cr_type are signaled in CTB level, a flag can be further signaledwith the same mechanism. For example, if the number of the C0 lumaposition candidates is 9, cc_sao_cb_type0_flag is further signaled todistinguish if the center collocated luma position is used as shown inTable 27 below. If the center collocated luma position is not used,cc_sao_cb_type_idc is used to indicate which of the remaining 8neighboring luma positions is used.

TABLE 27 cc_sao_cb_type0_flag is signaled to distinguish if the center collocated luma position is used ctb_cc_sao_cb_flag u(1)if( ctb_cc_sao_cb_flag )  cc_sao_cb_type0_flag u(1), can be contextcoded  if( !cc_sao_cb_type0_flag )   cc_sao_cb_type_idc u(3), can becontext coded

In some embodiments, an extension to the intra and inter post predictionSAO filter is illustrated further below. In some embodiments, the SAOclassification methods disclosed in the present disclosure can serve asa post prediction filter, and the prediction can be intra, inter, orother prediction tools such as Intra Block Copy. FIG. 27 is a blockdiagram illustrating that the SAO classification methods disclosed inthe present disclosure serve as a post prediction filter in accordancewith some implementations of the present disclosure.

In some embodiments, for each Y, U, and V component, a correspondingclassifier is chosen. And for each component prediction sample, it isfirst classified, and a corresponding offset is added. For example, eachcomponent can use the current and neighboring samples forclassification. Y uses the current Y and neighboring Y samples, and U/Vuses the current U/V samples for classification as shown in Table 28below. FIG. 28 is a block diagram illustrating that for post predictionSAO filter, each component can use the current and neighboring samplesfor classification in accordance with some implementations of thepresent disclosure.

TABLE 28 A corresponding classifier is chosen for each Y, U, and V component Offset  derived C0 from the  Compo- band_Total current POC nent Classifier num classes component 0 Y combine  1616*17 h_Y[i] C0 and C1 0 U C0 using  8 8 h_U[i] U0 position 0 VC0 using  32 32 h_V[i] V0 position

In some embodiments, the refined prediction samples (Ypred′, Upred′,Vpred′) are updated by adding the corresponding class offset and areused for intra, inter, or other prediction thereafter.

Ypred′=clip3(0,(1<<bit_depth)−1,Ypred+h_Y[i])

Upred′=clip3(0,(1<<bit_depth)−1,Upred+h_U[i])

Vpred′=clip3(0,(1<<bit_depth)−1,Vpred+h_V[i])

In some embodiments, for chroma U and V components, besides the currentchroma component, the cross-component (Y) can be used for further offsetclassification. The additional cross-component offset (h′_U, h′_V) canbe added on the current component offset (h_U, h_V), for example, asshown in Table 29 below.

TABLE 29 For chroma U and V components, besides the current chroma component, the cross-component (Y) can be used for further offset classification Offset  derived C0 from the band_ Total current POC Component Classifier num classes component 0 UC0 using  16 16 h’_U[i] Y4  position 0 V C0 using  7 7 h’_V[i] Y1 position

In some embodiments, the refined prediction samples (Upred″, Vpred″) areupdated by adding the corresponding class offset and are used for intra,inter, or other prediction thereafter.

Upred″=clip3(0,(1<<bit_depth)−1,Upred′+h′_U[i])

Vpred″=clip3(0,(1<<bit_depth)−1,Vpred′+h′_V[i])

In some embodiments, the intra and inter prediction can use differentSAO filter offsets.

FIG. 29 is a flowchart illustrating an exemplary process 2900 ofdecoding video signal using cross-component correlation when VB ispresent in accordance with some implementations of the presentdisclosure.

The video decoder 30 (as shown in FIG. 3 ), receives, from the videosignal, a picture frame that includes a first component and a secondcomponent (2910).

The video decoder 30, determines a classifier for the second componentfrom a set of samples of the first component associated with arespective sample of the second component (2920).

In response to a determination that the set of samples of the firstcomponent associated with the respective sample of the second componentis divided by a virtual boundary (2930-1): the video decoder 30 obtainsan updated set of samples of the first component by copying one or morecentral subsets of the set of samples of the first component to a firstboundary position and a second boundary position of the set of samplesof the first component, wherein the one or more central subsets are at asame side of the virtual boundary relative to the respective sample ofthe second component (2930-2).

The video decoder 30 determines a sample offset for the respectivesample of the second component according to the classifier based on theupdated set of samples of the first component (2940).

The video decoder 30 modifies the value of the respective sample of thesecond component based on the determined sample offset (2950).

In some embodiments, obtaining the updated set of samples of the firstcomponent by copying one or more central subsets of the set of samplesof the first component to the first boundary position and the secondboundary position of the set of samples of the first component (2930-2)comprises: in accordance with a determination that: a first subset ofthe set of samples of the first component associated with the respectivesample of the second component is located on the different side of thevirtual boundary relative to the respective sample of the secondcomponent, and a remaining subset of the set of samples of the firstcomponent associated with the respective sample of the second componentis located on a same side of the virtual boundary relative to therespective sample of the second component, copying a second subset ofthe one or more central subsets from the remaining subset of the set ofsamples of the first component to replace the first subset at the firstboundary position; and copying the second subset of the one or morecentral subsets from the remaining subset of the set of samples of thefirst component to replace a third subset in the remaining subset at asecond side.

In some embodiments, the third subset and the first subset aresymmetrical relative to a collocated sample of the first componentassociated with the respective sample of the second component.

In some embodiments, the second subset from the remaining subset of theset of samples of the first component is from a closest row to the firstsubset.

In some embodiments, the second subset from the remaining subset of theset of samples of the first component is from a closest row to the thirdsubset.

In some embodiments, obtaining the updated set of samples of the firstcomponent by copying one or more central subsets of the set of samplesof the first component to the first boundary position and the secondboundary position of the set of samples of the first component (2930-2)comprises: in accordance with a determination that: a first subset ofthe set of samples of the first component associated with the respectivesample of the second component is located on the different side of thevirtual boundary relative to the respective sample of the secondcomponent, and a remaining subset of the set of samples of the firstcomponent associated with the respective sample of the second componentis located on a same side of the virtual boundary relative to therespective sample of the second component, copying a second subset ofthe one or more central subsets from the remaining subset of the set ofsamples of the first component to replace the first subset at the firstboundary position; and copying a third subset of the one or more centralsubsets from the remaining subset of the set of samples of the firstcomponent to replace a fourth subset in the remaining subset at a secondside.

In some embodiments, the fourth subset and the first subset aresymmetrical relative to a collocated sample of the first componentassociated with the respective sample of the second component.

In some embodiments, the second subset from the remaining subset of theset of samples of the first component is from a closest row to the firstsubset.

In some embodiments, the third subset from the remaining subset of theset of samples of the first component is from a closest row to thefourth subset.

In some embodiments, the set of samples of the first component ishorizontal, or vertical symmetric relative to a collocated sample of thefirst component associated with the respective sample of the secondcomponent.

In some embodiments, the virtual boundary includes a first virtualboundary within a first block of the first component and a secondvirtual boundary within a second block of the second component.

In some embodiments, the virtual boundary includes a first virtualboundary within a first Coding Tree Block (CTB) of the first componentand a second virtual boundary within a second CTB of the secondcomponent, and the first virtual boundary is not aligned with the secondvirtual boundary within a Coding Tree Unit (CTU).

In some embodiments, the virtual boundary is parallel with a blockboundary and separated from the block boundary by at least one row orcolumn of samples.

In some embodiments, in accordance with a determination that the set ofone or more samples of the first component associated with therespective sample of the second component is divided by the virtualboundary, a subset of the one or more samples of the first component islocated on a different side of the virtual boundary relative to therespective sample of the second component, and the subset of the one ormore samples of the first component is within a boundary coding treeunit (CTU) row at a processing bottom of the picture frame, determiningto modify the value of the respective sample of the second component ofthe current block of the picture frame within the virtual boundaryaccording to the classifier. For example, at the bottom picture (orslice, tile, brick) boundary CTU row, the samples below VB are processedat the current CTU row, so the special handling (Solution 1, 2, 3, 4) isnot applied at the bottom picture (or slice, tile, brick) boundary CTUrow.

Further embodiments also include various subsets of the aboveembodiments combined or otherwise re-arranged in various otherembodiments.

In one or more examples, the functions described may be implemented inhardware, software, firmware, or any combination thereof. If implementedin software, the functions may be stored on or transmitted over, as oneor more instructions or code, a computer-readable medium and executed bya hardware-based processing unit. Computer-readable media may includecomputer-readable storage media, which corresponds to a tangible mediumsuch as data storage media, or communication media including any mediumthat facilitates transfer of a computer program from one place toanother, e.g., according to a communication protocol. In this manner,computer-readable media generally may correspond to (1) tangiblecomputer-readable storage media which is non-transitory or (2) acommunication medium such as a signal or carrier wave. Data storagemedia may be any available media that can be accessed by one or morecomputers or one or more processors to retrieve instructions, codeand/or data structures for implementation of the implementationsdescribed in the present application. A computer program product mayinclude a computer-readable medium.

The terminology used in the description of the implementations herein isfor the purpose of describing particular implementations only and is notintended to limit the scope of claims. As used in the description of theimplementations and the appended claims, the singular forms “a,” “an,”and “the” are intended to include the plural forms as well, unless thecontext clearly indicates otherwise. It will also be understood that theterm “and/or” as used herein refers to and encompasses any and allpossible combinations of one or more of the associated listed items. Itwill be further understood that the terms “comprises” and/or“comprising,” when used in this specification, specify the presence ofstated features, elements, and/or components, but do not preclude thepresence or addition of one or more other features, elements,components, and/or groups thereof.

It will also be understood that, although the terms first, second, etc.may be used herein to describe various elements, these elements shouldnot be limited by these terms. These terms are only used to distinguishone element from another. For example, a first electrode could be termeda second electrode, and, similarly, a second electrode could be termed afirst electrode, without departing from the scope of theimplementations. The first electrode and the second electrode are bothelectrodes, but they are not the same electrode.

Reference throughout this specification to “one example,” “an example,”“exemplary example,” or the like in the singular or plural means thatone or more particular features, structures, or characteristicsdescribed in connection with an example is included in at least oneexample of the present disclosure. Thus, the appearances of the phrases“in one example” or “in an example,” “in an exemplary example,” or thelike in the singular or plural in various places throughout thisspecification are not necessarily all referring to the same example.Furthermore, the particular features, structures, or characteristics inone or more examples may include combined in any suitable manner.

The description of the present application has been presented forpurposes of illustration and description, and is not intended to beexhaustive or limited to the invention in the form disclosed. Manymodifications, variations, and alternative implementations will beapparent to those of ordinary skill in the art having the benefit of theteachings presented in the foregoing descriptions and the associateddrawings. The embodiment was chosen and described in order to bestexplain the principles of the invention, the practical application, andto enable others skilled in the art to understand the invention forvarious implementations and to best utilize the underlying principlesand various implementations with various modifications as are suited tothe particular use contemplated. Therefore, it is to be understood thatthe scope of claims is not to be limited to the specific examples of theimplementations disclosed and that modifications and otherimplementations are intended to be included within the scope of theappended claims.

What is claimed is:
 1. A method of decoding a video signal, comprising:receiving, from the video signal, a picture frame that includes a firstcomponent and a second component; determining a classifier for thesecond component from a set of samples of the first component associatedwith a respective sample of the second component; in response to adetermination that the set of samples of the first component associatedwith the respective sample of the second component is divided by avirtual boundary, obtaining an updated set of samples of the firstcomponent by copying one or more central subsets of the set of samplesof the first component to a first boundary position and a secondboundary position of the set of samples of the first component, whereinthe one or more central subsets are at a same side of the virtualboundary relative to the respective sample of the second component;determining a sample offset for the respective sample of the secondcomponent according to the classifier based on the updated set ofsamples of the first component; and modifying a value of the respectivesample of the second component based on the determined sample offset. 2.The method of claim 1, wherein obtaining the updated set of samples ofthe first component by copying the one or more central subsets of theset of samples of the first component to the first boundary position andthe second boundary position of the set of samples of the firstcomponent comprises: in accordance with a determination that: a firstsubset of the set of samples of the first component associated with therespective sample of the second component is located on a different sideof the virtual boundary relative to the respective sample of the secondcomponent, and a remaining subset of the set of samples of the firstcomponent associated with the respective sample of the second componentis located on a same side of the virtual boundary relative to therespective sample of the second component, copying a second subset ofthe one or more central subsets from the remaining subset of the set ofsamples of the first component to replace the first subset at the firstboundary position; and copying the second subset of the one or morecentral subsets from the remaining subset of the set of samples of thefirst component to replace a third subset in the remaining subset at thesecond boundary position.
 3. The method of claim 2, wherein the thirdsubset and the first subset are symmetrical relative to a collocatedsample of the first component associated with the respective sample ofthe second component.
 4. The method of claim 2, wherein the secondsubset from the remaining subset of the set of samples of the firstcomponent is from a closest row to the first subset.
 5. The method ofclaim 2, wherein the second subset from the remaining subset of the setof samples of the first component is from a closest row to the thirdsubset.
 6. The method of claim 1, wherein obtaining the updated set ofsamples of the first component by copying the one or more centralsubsets of the set of samples of the first component to the firstboundary position and the second boundary position of the set of samplesof the first component comprises: in accordance with a determinationthat: a first subset of the set of samples of the first componentassociated with the respective sample of the second component is locatedon a different side of the virtual boundary relative to the respectivesample of the second component, and a remaining subset of the set ofsamples of the first component associated with the respective sample ofthe second component is located on a same side of the virtual boundaryrelative to the respective sample of the second component, copying asecond subset of the one or more central subsets from the remainingsubset of the set of samples of the first component to replace the firstsubset at the first boundary position; and copying a third subset of theone or more central subsets from the remaining subset of the set ofsamples of the first component to replace a fourth subset in theremaining subset at the second boundary position.
 7. The method of claim6, wherein the fourth subset and the first subset are symmetricalrelative to a collocated sample of the first component associated withthe respective sample of the second component.
 8. The method of claim 6,wherein the second subset from the remaining subset of the set ofsamples of the first component is from a closest row to the firstsubset.
 9. The method of claim 6, wherein the third subset from theremaining subset of the set of samples of the first component is from aclosest row to the fourth subset.
 10. The method of claim 1, wherein theset of samples of the first component is horizontal, or verticalsymmetric relative to a collocated sample of the first componentassociated with the respective sample of the second component.
 11. Themethod of claim 1, wherein the virtual boundary includes a first virtualboundary within a first block of the first component and a secondvirtual boundary within a second block of the second component.
 12. Themethod of claim 1, wherein the virtual boundary includes a first virtualboundary within a first Coding Tree Block (CTB) of the first componentand a second virtual boundary within a second CTB of the secondcomponent, and the first virtual boundary is not aligned with the secondvirtual boundary within a Coding Tree Unit (CTU).
 13. The method ofclaim 1, wherein the virtual boundary is parallel with a block boundaryand separated from the block boundary by at least one row or column ofsamples.
 14. An electronic apparatus comprising: one or more processingunits; memory coupled to the one or more processing units; and aplurality of programs stored in the memory that, when executed by theone or more processing units, cause the electronic apparatus to:receive, from a video signal, a picture frame that includes a firstcomponent and a second component; determine a classifier for the secondcomponent from a set of samples of the first component associated with arespective sample of the second component; in response to adetermination that the set of samples of the first component associatedwith the respective sample of the second component is divided by avirtual boundary, obtain an updated set of samples of the firstcomponent by copying one or more central subsets of the set of samplesof the first component to a first boundary position and a secondboundary position of the set of samples of the first component, whereinthe one or more central subsets are at a same side of the virtualboundary relative to the respective sample of the second component;determine a sample offset for the respective sample of the secondcomponent according to the classifier based on the updated set ofsamples of the first component; and modify a value of the respectivesample of the second component based on the determined sample offset.15. The apparatus of claim 14, wherein obtaining the updated set ofsamples of the first component by copying the one or more centralsubsets of the set of samples of the first component to the firstboundary position and the second boundary position of the set of samplesof the first component comprises: in accordance with a determinationthat: a first subset of the set of samples of the first componentassociated with the respective sample of the second component is locatedon a different side of the virtual boundary relative to the respectivesample of the second component, and a remaining subset of the set ofsamples of the first component associated with the respective sample ofthe second component is located on a same side of the virtual boundaryrelative to the respective sample of the second component, copying asecond subset of the one or more central subsets from the remainingsubset of the set of samples of the first component to replace the firstsubset at the first boundary position; and copying the second subset ofthe one or more central subsets from the remaining subset of the set ofsamples of the first component to replace a third subset in theremaining subset at the second boundary position.
 16. The apparatus ofclaim 15, wherein the third subset and the first subset are symmetricalrelative to a collocated sample of the first component associated withthe respective sample of the second component.
 17. The apparatus ofclaim 15, wherein the second subset from the remaining subset of the setof samples of the first component is from a closest row to the firstsubset.
 18. The apparatus of claim 15, wherein the second subset fromthe remaining subset of the set of samples of the first component isfrom a closest row to the third subset.
 19. The apparatus of claim 14,wherein obtaining the updated set of samples of the first component bycopying the one or more central subsets of the set of samples of thefirst component to the first boundary position and the second boundaryposition of the set of samples of the first component comprises: inaccordance with a determination that: a first subset of the set ofsamples of the first component associated with the respective sample ofthe second component is located on a different side of the virtualboundary relative to the respective sample of the second component, anda remaining subset of the set of samples of the first componentassociated with the respective sample of the second component is locatedon a same side of the virtual boundary relative to the respective sampleof the second component, copying a second subset of the one or morecentral subsets from the remaining subset of the set of samples of thefirst component to replace the first subset at the first boundaryposition; and copying a third subset of the one or more central subsetsfrom the remaining subset of the set of samples of the first componentto replace a fourth subset in the remaining subset at the secondboundary position.
 20. A non-transitory computer readable storage mediumstoring a plurality of programs for execution by an electronic apparatushaving one or more processing units, wherein the plurality of programs,when executed by the one or more processing units, cause the electronicapparatus to receive a bitstream and perform the following steps:receive, from the bitstream, a picture frame that includes a firstcomponent and a second component; determine a classifier for the secondcomponent from a set of samples of the first component associated with arespective sample of the second component; in response to adetermination that the set of samples of the first component associatedwith the respective sample of the second component is divided by avirtual boundary, obtain an updated set of samples of the firstcomponent by copying one or more central subsets of the set of samplesof the first component to a first boundary position and a secondboundary position of the set of samples of the first component, whereinthe one or more central subsets are at a same side of the virtualboundary relative to the respective sample of the second component;determine a sample offset for the respective sample of the secondcomponent according to the classifier based on the updated set ofsamples of the first component; and modify a value of the respectivesample of the second component based on the determined sample offset.